TSTP Solution File: SWC287-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC287-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 : art09.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 19.5s
% Output : Assurance 19.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/SWC287-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,0,402,0,1,57836,4,2261)
%
%
% START OF PROOF
% 202 [] equal(X,X).
% 205 [] strictordered^p(nil).
% 210 [] ss^list(nil).
% 268 [] strictordered^p(cons(X,nil)) | -ss^item(X).
% 275 [] equal(app(X,nil),X) | -ss^list(X).
% 347 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 390 [] ss^list(sk3).
% 393 [] equal(sk1,sk3).
% 394 [] -strictordered^p(sk1).
% 396 [] equal(nil,sk3) | ss^item(sk5).
% 400 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 790 [hyper:275,390] equal(app(sk3,nil),sk3).
% 2047 [hyper:268,396] strictordered^p(cons(sk5,nil)) | equal(nil,sk3).
% 12819 [hyper:347,400,202,cut:390,demod:790,cut:210] equal(cons(sk5,nil),sk3) | equal(sk3,nil).
% 61561 [para:393.1.1,394.1.1] -strictordered^p(sk3).
% 62341 [para:12819.2.1,61561.1.1,cut:205] equal(cons(sk5,nil),sk3).
% 62660 [para:2047.2.2,61561.1.1,demod:62341,cut:205,cut:61561] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 77
% derived clauses: 75370
% kept clauses: 45986
% kept size sum: 667453
% kept mid-nuclei: 16000
% kept new demods: 32961
% forw unit-subs: 4162
% forw double-subs: 4210
% forw overdouble-subs: 157
% backward subs: 8
% fast unit cutoff: 2489
% full unit cutoff: 0
% dbl unit cutoff: 15
% real runtime : 24.69
% process. runtime: 24.20
% specific non-discr-tree subsumption statistics:
% tried: 16321
% length fails: 2
% strength fails: 3883
% predlist fails: 4690
% aux str. fails: 1838
% by-lit fails: 644
% full subs tried: 4966
% full subs fail: 4817
%
% ; 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/SWC287-1+eq_r.in")
%
%------------------------------------------------------------------------------