TSTP Solution File: SWC292-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC292-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 : art07.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/SWC292-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(197,40,1,394,0,1,53322,4,2202,55424,5,2804,55425,1,2804,55425,50,2807,55425,40,2807,55622,0,2807)
%
%
% START OF PROOF
% 55067 [?] ?
% 55429 [] strictordered^p(nil).
% 55434 [] ss^list(nil).
% 55492 [] strictordered^p(cons(X,nil)) | -ss^item(X).
% 55499 [] equal(app(X,nil),X) | -ss^list(X).
% 55526 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 55544 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 55613 [] ss^list(sk2).
% 55615 [] ss^list(sk4).
% 55616 [] equal(sk2,sk4).
% 55617 [] equal(sk1,sk3).
% 55618 [] -strictordered^p(sk1).
% 55619 [] -equal(nil,sk4) | equal(nil,sk3).
% 55620 [] -neq(sk4,nil) | ss^item(sk5).
% 55621 [] equal(cons(sk5,nil),sk3) | -neq(sk4,nil).
% 56391 [para:55619.2.2,55617.1.2] -equal(nil,sk4) | equal(sk1,nil).
% 56394 [para:55616.1.2,55620.1.1] -neq(sk2,nil) | ss^item(sk5).
% 56405 [para:56391.2.1,55618.1.1,cut:55429] -equal(nil,sk4).
% 56406 [para:55616.1.2,56405.1.2] -equal(nil,sk2).
% 56849 [binary:55613,55499.2] equal(app(sk2,nil),sk2).
% 56851 [binary:55615,55499.2] equal(app(sk4,nil),sk4).
% 59311 [para:56849.1.1,55544.1.1,cut:56406,cut:55613,cut:55434] -equal(sk2,nil).
% 59339 [para:56851.1.1,55544.1.1,cut:56405,cut:55615,cut:55434] -equal(sk4,nil).
% 59364 [binary:55526.2,59311,cut:55434,cut:55613] neq(sk2,nil).
% 59371 [binary:55526.2,59339,cut:55434,cut:55615] neq(sk4,nil).
% 59375 [binary:56394,59364] ss^item(sk5).
% 59422 [binary:55621.2,59371] equal(cons(sk5,nil),sk3).
% 60014 [para:59422.1.1,55492.1.1,cut:55067,cut:59375] 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: 506
% derived clauses: 70607
% kept clauses: 44027
% kept size sum: 630024
% kept mid-nuclei: 14733
% kept new demods: 32495
% forw unit-subs: 4310
% forw double-subs: 1877
% forw overdouble-subs: 592
% backward subs: 27
% fast unit cutoff: 1291
% full unit cutoff: 0
% dbl unit cutoff: 137
% real runtime : 28.45
% process. runtime: 28.44
% specific non-discr-tree subsumption statistics:
% tried: 55062
% length fails: 221
% strength fails: 16336
% predlist fails: 13129
% aux str. fails: 2020
% by-lit fails: 928
% full subs tried: 20203
% full subs fail: 19284
%
% ; 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/SWC292-1+eq_r.in")
%
%------------------------------------------------------------------------------