TSTP Solution File: SWC118-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC118-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art02.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 20.0s
% Output : Assurance 20.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SWC/SWC118-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(201,40,1,409,0,1,50121,4,2221,52020,5,2802,52021,1,2804,52021,50,2806,52021,40,2806,52229,0,2807)
%
%
% START OF PROOF
% 52030 [] ss^list(nil).
% 52095 [] equal(app(X,nil),X) | -ss^list(X).
% 52122 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52140 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 52195 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 52214 [] equal(app(app(sk5,sk3),sk6),sk4).
% 52215 [] ss^list(sk6).
% 52216 [] ss^list(sk5).
% 52217 [] equal(sk1,sk3).
% 52218 [] equal(sk2,sk4).
% 52219 [] ss^list(sk4).
% 52220 [] ss^list(sk3).
% 52222 [] ss^list(sk1).
% 52227 [] -equal(nil,sk3) | equal(nil,sk4).
% 52228 [] -equal(nil,sk2) | -equal(nil,sk1).
% 52229 [] -neq(sk1,nil) | -segment^p(sk2,sk1).
% 53204 [para:52217.1.2,52227.1.2] -equal(nil,sk1) | equal(nil,sk4).
% 53766 [para:52218.1.2,53204.2.2,binarycut:52228] -equal(nil,sk1).
% 53826 [binary:52222,52095.2] equal(app(sk1,nil),sk1).
% 56864 [para:53826.1.1,52140.1.1,cut:53766,cut:52222,cut:52030] -equal(sk1,nil).
% 56894 [binary:52122.2,56864,cut:52030,cut:52222] neq(sk1,nil).
% 56898 [binary:52229,56894] -segment^p(sk2,sk1).
% 66576 [binary:52214,52195,cut:52219,cut:52220,cut:52215,cut:52216] segment^p(sk4,sk3).
% 66781 [para:52217.1.2,66576.1.2] segment^p(sk4,sk1).
% 66788 [para:52218.1.2,66781.1.1,cut:56898] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 19
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 797
% derived clauses: 99729
% kept clauses: 51321
% kept size sum: 724620
% kept mid-nuclei: 13936
% kept new demods: 30281
% forw unit-subs: 4586
% forw double-subs: 2253
% forw overdouble-subs: 948
% backward subs: 18
% fast unit cutoff: 2245
% full unit cutoff: 0
% dbl unit cutoff: 159
% real runtime : 29.56
% process. runtime: 29.54
% specific non-discr-tree subsumption statistics:
% tried: 144603
% length fails: 1167
% strength fails: 17882
% predlist fails: 82909
% aux str. fails: 4362
% by-lit fails: 1028
% full subs tried: 27869
% full subs fail: 26606
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SWC/SWC118-1+eq_r.in")
%
%------------------------------------------------------------------------------