TSTP Solution File: SWC348-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC348-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 29.4s
% Output : Assurance 29.4s
% 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/SWC348-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(195,40,3,390,0,3,55062,4,2267,56925,5,2805,56926,1,2807,56926,50,2810,56926,40,2810,57121,0,2810)
%
%
% START OF PROOF
% 56930 [] strictordered^p(nil).
% 56935 [] ss^list(nil).
% 56974 [] ss^item(skaf44(X)).
% 56993 [] strictordered^p(cons(X,nil)) | -ss^item(X).
% 57007 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57027 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57028 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 57113 [] ss^list(sk1).
% 57116 [] ss^list(sk4).
% 57117 [] equal(sk2,sk4).
% 57118 [] equal(sk1,sk3).
% 57119 [] segment^p(sk4,sk3).
% 57120 [] -neq(sk4,nil) | singleton^p(sk3).
% 57121 [?] ?
% 57888 [para:57117.1.2,57119.1.1] segment^p(sk2,sk3).
% 57889 [para:57118.1.2,57119.1.2] segment^p(sk4,sk1).
% 57892 [para:57118.1.2,57120.2.1] -neq(sk4,nil) | singleton^p(sk1).
% 57893 [para:57118.1.2,57888.1.2] segment^p(sk2,sk1).
% 57894 [input:57121,cut:57893] -strictordered^p(sk1).
% 58212 [binary:56974,56993.2] strictordered^p(cons(skaf44(X),nil)).
% 58438 [binary:57113,57007.3] -segment^p(nil,sk1) | equal(nil,sk1).
% 67615 [para:57028.1.1,58212.1.1] -singleton^p(X) | -ss^list(X) | strictordered^p(X).
% 70814 [para:58438.2.2,57894.1.1,cut:56930] -segment^p(nil,sk1).
% 77154 [binary:57894,67615.3,cut:57113] -singleton^p(sk1).
% 77212 [binary:57892.2,77154] -neq(sk4,nil).
% 77375 [binary:57027,77212,cut:56935,cut:57116] equal(sk4,nil).
% 77411 [para:77375.1.1,57889.1.1,cut:70814] 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: 873
% derived clauses: 108317
% kept clauses: 60554
% kept size sum: 903629
% kept mid-nuclei: 14895
% kept new demods: 32686
% forw unit-subs: 5094
% forw double-subs: 2328
% forw overdouble-subs: 1029
% backward subs: 22
% fast unit cutoff: 2898
% full unit cutoff: 0
% dbl unit cutoff: 155
% real runtime : 31.13
% process. runtime: 30.45
% specific non-discr-tree subsumption statistics:
% tried: 337689
% length fails: 5507
% strength fails: 21650
% predlist fails: 237164
% aux str. fails: 12159
% by-lit fails: 2080
% full subs tried: 41532
% full subs fail: 40194
%
% ; 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/SWC348-1+eq_r.in")
%
%------------------------------------------------------------------------------