TSTP Solution File: SWC104-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC104-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 : art01.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/SWC104-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(199,40,0,404,0,1,50074,4,2163,52026,5,2803,52027,1,2803,52027,50,2805,52027,40,2805,52232,0,2806)
%
%
% START OF PROOF
% 52028 [] equal(X,X).
% 52036 [] ss^list(nil).
% 52101 [] equal(app(X,nil),X) | -ss^list(X).
% 52128 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52143 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 52146 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 52172 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 52218 [] equal(app(sk3,sk5),sk4).
% 52219 [] ss^list(sk5).
% 52220 [] neq(sk2,nil).
% 52221 [] equal(sk1,sk3).
% 52222 [] equal(sk2,sk4).
% 52223 [] ss^list(sk4).
% 52226 [] ss^list(sk1).
% 52231 [] -equal(nil,sk3) | equal(nil,sk4).
% 52232 [] -neq(sk1,nil) | -frontseg^p(sk2,sk1).
% 52251 [input:52143,factor:cut:52028] -neq(X,X) | -ss^list(X).
% 53026 [para:52221.1.2,52218.1.1.1] equal(app(sk1,sk5),sk4).
% 53114 [para:52221.1.2,52231.1.2] -equal(nil,sk1) | equal(nil,sk4).
% 53698 [binary:52226,52101.2] equal(app(sk1,nil),sk1).
% 54714 [binary:52223,52251.2] -neq(sk4,sk4).
% 54779 [para:52222.1.2,54714.1.1] -neq(sk2,sk4).
% 54827 [para:53114.2.2,54779.1.2,cut:52220] -equal(nil,sk1).
% 56655 [para:53698.1.1,52146.1.1,cut:54827,cut:52226,cut:52036] -equal(sk1,nil).
% 56706 [binary:52128.2,56655,cut:52036,cut:52226] neq(sk1,nil).
% 56949 [binary:52232,56706] -frontseg^p(sk2,sk1).
% 60738 [binary:53026,52172,cut:52223,cut:52226,cut:52219] frontseg^p(sk4,sk1).
% 60804 [para:52222.1.2,60738.1.1,cut:56949] 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: 630
% derived clauses: 97124
% kept clauses: 45370
% kept size sum: 634014
% kept mid-nuclei: 14104
% kept new demods: 30205
% forw unit-subs: 4534
% forw double-subs: 2066
% forw overdouble-subs: 819
% backward subs: 17
% fast unit cutoff: 1588
% full unit cutoff: 0
% dbl unit cutoff: 147
% real runtime : 28.78
% process. runtime: 28.74
% specific non-discr-tree subsumption statistics:
% tried: 89464
% length fails: 3926
% strength fails: 17272
% predlist fails: 39548
% aux str. fails: 2751
% by-lit fails: 892
% full subs tried: 22980
% full subs fail: 21853
%
% ; 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/SWC104-1+eq_r.in")
%
%------------------------------------------------------------------------------