TSTP Solution File: SWC168-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC168-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 : art04.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 89.5s
% Output : Assurance 89.5s
% 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/SWC168-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(205,40,1,421,0,1,49323,4,2112,51310,5,2802,51311,1,2802,51311,50,2805,51311,40,2805,51527,0,2805,141205,3,4223,182244,4,4908,199825,5,5606,199826,5,5608,199827,1,5608,199827,50,5611,199827,40,5611,200043,0,5612,242284,3,6163,259048,4,6441,269834,5,6724,269834,5,6725,269835,1,6725,269835,50,6728,269835,40,6728,270051,0,6728,327097,3,7579,343480,4,8005,359602,5,8431,359603,5,8432,359604,1,8432,359604,50,8435,359604,40,8435,359820,0,8435,432759,3,9287,455097,4,9713)
%
%
% START OF PROOF
% 359613 [] ss^list(nil).
% 359690 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 359691 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 359707 [] neq(X,Y) | equal(X,Y) | -ss^item(Y) | -ss^item(X).
% 359716 [] -lt(X,Y) | -equal(X,Y) | -ss^item(Y) | -ss^item(X).
% 359725 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 359754 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 359786 [] -equal(app(app(X,cons(Y,Z)),cons(U,V)),W) | lt(Y,U) | -ss^item(U) | -ss^item(Y) | -ss^list(W) | -ss^list(Z) | -ss^list(X) | -ss^list(V) | -strictordered^p(W).
% 359792 [] -neq(sk7,sk8).
% 359793 [] equal(app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10),sk1).
% 359794 [] ss^list(sk10).
% 359795 [] ss^list(sk9).
% 359796 [] ss^item(sk8).
% 359797 [] ss^item(sk7).
% 359800 [] strictordered^p(sk3).
% 359804 [] equal(sk1,sk3).
% 359809 [] ss^list(sk1).
% 359876 [binary:359725.3,359794] equal(app(cons(X,nil),sk10),cons(X,sk10)) | -ss^item(X).
% 359917 [binary:359754.3,359794] equal(app(app(X,Y),sk10),app(X,app(Y,sk10))) | -ss^list(Y) | -ss^list(X).
% 360018 [binary:359690.2,359795] ss^list(app(sk9,X)) | -ss^list(X).
% 360184 [binary:359691.2,359796] ss^list(cons(sk8,X)) | -ss^list(X).
% 360284 [binary:359691.2,359797] ss^list(cons(sk7,X)) | -ss^list(X).
% 361230 [binary:359707,359792,cut:359796,cut:359797] equal(sk7,sk8).
% 361488 [para:359804.1.2,359800.1.1] strictordered^p(sk1).
% 362889 [binary:359716.2,361230,cut:359796,cut:359797] -lt(sk7,sk8).
% 382411 [binary:359796,359876.2] equal(app(cons(sk8,nil),sk10),cons(sk8,sk10)).
% 395662 [para:359917.1.1,359793.1.1,demod:382411,binarydemod:360184,360284,360018,cut:359613] equal(app(app(sk9,cons(sk7,nil)),cons(sk8,sk10)),sk1).
% 458065 [binary:395662,359786,cut:362889,cut:359796,cut:359797,cut:359809,cut:359613,cut:359795,cut:359794,cut:361488] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5126
% derived clauses: 677710
% kept clauses: 305791
% kept size sum: 0
% kept mid-nuclei: 60612
% kept new demods: 33005
% forw unit-subs: 63275
% forw double-subs: 18507
% forw overdouble-subs: 13230
% backward subs: 74
% fast unit cutoff: 52629
% full unit cutoff: 0
% dbl unit cutoff: 1510
% real runtime : 98.6
% process. runtime: 97.50
% specific non-discr-tree subsumption statistics:
% tried: 4617884
% length fails: 12684
% strength fails: 666766
% predlist fails: 3132767
% aux str. fails: 124283
% by-lit fails: 85913
% full subs tried: 520756
% full subs fail: 506472
%
% ; 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/SWC168-1+eq_r.in")
%
%------------------------------------------------------------------------------