TSTP Solution File: SWC028-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC028-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 : art10.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/SWC028-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,55642,4,2238,57738,5,2803,57739,1,2805,57739,50,2808,57739,40,2808,57939,0,2808)
%
%
% START OF PROOF
% 57740 [] equal(X,X).
% 57797 [] segment^p(X,X) | -ss^list(X).
% 57820 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57822 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57855 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57926 [] ss^list(sk1).
% 57928 [] ss^list(sk3).
% 57929 [] ss^list(sk4).
% 57930 [] equal(sk2,sk4).
% 57931 [] equal(sk1,sk3).
% 57932 [] equal(nil,sk2) | equal(nil,sk1).
% 57935 [] -equal(nil,sk1) | -equal(nil,sk2).
% 57936 [] neq(sk3,nil) | equal(nil,sk4).
% 57939 [] rearseg^p(sk4,sk3) | equal(nil,sk3).
% 57953 [input:57855,factor:cut:57740] -neq(X,X) | -ss^list(X).
% 58710 [para:57930.1.2,57936.2.2] neq(sk3,nil) | equal(nil,sk2).
% 58729 [para:57931.1.2,58710.1.1] neq(sk1,nil) | equal(nil,sk2).
% 58757 [binary:57929,57797.2] segment^p(sk4,sk4).
% 58860 [para:57930.1.2,58757.1.1] segment^p(sk2,sk4).
% 59480 [binary:57928,57822.3] -rearseg^p(nil,sk3) | equal(nil,sk3).
% 60155 [binary:57926,57953.2] -neq(sk1,sk1).
% 60189 [para:57932.2.2,60155.1.2,binarycut:58729] equal(nil,sk2).
% 60245 [para:60189.1.2,57935.2.2,cut:57740] -equal(nil,sk1).
% 60248 [para:60189.1.2,58860.1.1] segment^p(nil,sk4).
% 60340 [binary:57820,60248,cut:57929] equal(nil,sk4).
% 60511 [para:60340.1.2,57939.1.1,binarycut:59480] equal(nil,sk3).
% 60513 [para:57931.1.2,60511.1.2,cut:60245] 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: 372
% derived clauses: 90101
% kept clauses: 44098
% kept size sum: 624364
% kept mid-nuclei: 15170
% kept new demods: 32383
% forw unit-subs: 4194
% forw double-subs: 2263
% forw overdouble-subs: 467
% backward subs: 27
% fast unit cutoff: 1428
% full unit cutoff: 0
% dbl unit cutoff: 138
% real runtime : 28.66
% process. runtime: 28.19
% specific non-discr-tree subsumption statistics:
% tried: 47160
% length fails: 242
% strength fails: 16142
% predlist fails: 6475
% aux str. fails: 2089
% by-lit fails: 934
% full subs tried: 20081
% full subs fail: 19331
%
% ; 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/SWC028-1+eq_r.in")
%
%------------------------------------------------------------------------------