TSTP Solution File: SWC058-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC058-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 : art08.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/SWC058-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,2,400,0,2,55647,4,2236,57638,5,2803,57638,1,2803,57638,50,2805,57638,40,2805,57838,0,2805,150624,3,4208,175513,4,4919,193081,5,5606,193081,5,5608,193082,1,5608,193082,50,5612,193082,40,5612,193282,0,5612,235430,3,6164,247036,4,6440,260789,5,6713,260789,5,6714,260790,1,6714,260790,50,6716,260790,40,6716,260990,0,6716,321166,3,7569,335390,4,7992)
%
%
% START OF PROOF
% 194178 [?] ?
% 222843 [?] ?
% 223127 [?] ?
% 223540 [?] ?
% 260799 [] ss^list(nil).
% 260841 [] ss^list(skaf46(X,Y)).
% 260864 [] equal(app(X,nil),X) | -ss^list(X).
% 260922 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 260964 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 260977 [] ss^list(sk1).
% 260978 [] ss^list(sk2).
% 260981 [] equal(sk2,sk4).
% 260982 [] equal(sk1,sk3).
% 260984 [] equal(nil,sk2) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 260988 [] rearseg^p(sk4,sk3) | equal(nil,sk4).
% 261320 [binary:260977,260984.5,cut:194178,cut:222843] -segment^p(sk2,sk1) | equal(nil,sk2).
% 261358 [para:260988.2.2,260981.1.2,cut:223540] rearseg^p(sk4,sk3).
% 261378 [para:260981.1.2,261358.1.1] rearseg^p(sk2,sk3).
% 261390 [para:260982.1.2,261378.1.2] rearseg^p(sk2,sk1).
% 261394 [para:261320.2.2,261378.1.1,cut:223127] -segment^p(sk2,sk1).
% 266609 [binary:261390,260922.2,cut:260978,cut:260977] equal(app(skaf46(sk2,sk1),sk1),sk2).
% 274094 [para:260864.1.1,260964.1.1,cut:260799] -equal(app(X,Y),Z) | -ss^list(app(X,Y)) | segment^p(Z,Y) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 343564 [binary:266609,274094,demod:266609,cut:261394,cut:260841,cut:260977,cut:260978] 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: 4096
% derived clauses: 487624
% kept clauses: 238353
% kept size sum: 0
% kept mid-nuclei: 54525
% kept new demods: 34900
% forw unit-subs: 59416
% forw double-subs: 15505
% forw overdouble-subs: 8998
% backward subs: 144
% fast unit cutoff: 47489
% full unit cutoff: 1
% dbl unit cutoff: 874
% real runtime : 82.41
% process. runtime: 81.88
% specific non-discr-tree subsumption statistics:
% tried: 2599116
% length fails: 35137
% strength fails: 200040
% predlist fails: 1868513
% aux str. fails: 65140
% by-lit fails: 42621
% full subs tried: 327140
% full subs fail: 316827
%
% ; 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/SWC058-1+eq_r.in")
%
%------------------------------------------------------------------------------