TSTP Solution File: SWC057-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC057-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 79.5s
% Output : Assurance 79.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/SWC057-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(200,40,1,400,0,1,55771,4,2263,57776,5,2802,57777,1,2804,57777,50,2806,57777,40,2806,57977,0,2806,147556,3,4218,172956,4,4911,190804,5,5607,190805,5,5608,190806,1,5608,190806,50,5612,190806,40,5612,191006,0,5612,232699,3,6163,243335,4,6440,259361,5,6713,259361,5,6714,259362,1,6714,259362,50,6716,259362,40,6716,259562,0,6716,319170,3,7567,333760,4,7992)
%
%
% START OF PROOF
% 191902 [?] ?
% 220567 [?] ?
% 220855 [?] ?
% 221270 [?] ?
% 259371 [] ss^list(nil).
% 259414 [] ss^list(skaf45(X,Y)).
% 259437 [] equal(app(nil,X),X) | -ss^list(X).
% 259495 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 259536 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 259549 [] ss^list(sk1).
% 259550 [] ss^list(sk2).
% 259553 [] equal(sk2,sk4).
% 259554 [] equal(sk1,sk3).
% 259556 [] equal(nil,sk2) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 259560 [] frontseg^p(sk4,sk3) | equal(nil,sk4).
% 259892 [binary:259549,259556.5,cut:191902,cut:220567] -segment^p(sk2,sk1) | equal(nil,sk2).
% 259930 [para:259560.2.2,259553.1.2,cut:221270] frontseg^p(sk4,sk3).
% 259950 [para:259553.1.2,259930.1.1] frontseg^p(sk2,sk3).
% 259962 [para:259554.1.2,259950.1.2] frontseg^p(sk2,sk1).
% 259966 [para:259892.2.2,259950.1.1,cut:220855] -segment^p(sk2,sk1).
% 265462 [binary:259962,259495.2,cut:259550,cut:259549] equal(app(sk1,skaf45(sk2,sk1)),sk2).
% 272668 [para:259437.1.1,259536.1.1.1,cut:259371] -equal(app(X,Y),Z) | segment^p(Z,X) | -ss^list(Y) | -ss^list(X) | -ss^list(Z).
% 342172 [binary:265462,272668,cut:259966,cut:259414,cut:259549,cut:259550] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not 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: 4071
% derived clauses: 482693
% kept clauses: 237473
% kept size sum: 0
% kept mid-nuclei: 57386
% kept new demods: 34904
% forw unit-subs: 60784
% forw double-subs: 15650
% forw overdouble-subs: 9013
% backward subs: 144
% fast unit cutoff: 50183
% full unit cutoff: 1
% dbl unit cutoff: 871
% real runtime : 82.73
% process. runtime: 82.21
% specific non-discr-tree subsumption statistics:
% tried: 2618233
% length fails: 36493
% strength fails: 214798
% predlist fails: 1873918
% aux str. fails: 64923
% by-lit fails: 42332
% full subs tried: 325312
% full subs fail: 314984
%
% ; 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/SWC057-1+eq_r.in")
%
%------------------------------------------------------------------------------