TSTP Solution File: SWC332-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC332-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 29.5s
% Output : Assurance 29.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/SWC332-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,0,390,0,1,55062,4,2222,56945,5,2802,56946,1,2804,56946,50,2807,56946,40,2807,57141,0,2807)
%
%
% START OF PROOF
% 56948 [] equalelems^p(nil).
% 56955 [] ss^list(nil).
% 56994 [] ss^item(skaf44(X)).
% 57011 [] equalelems^p(cons(X,nil)) | -ss^item(X).
% 57027 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57047 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57048 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 57133 [] ss^list(sk1).
% 57136 [] ss^list(sk4).
% 57137 [] equal(sk2,sk4).
% 57138 [] equal(sk1,sk3).
% 57139 [] segment^p(sk4,sk3).
% 57140 [] -neq(sk4,nil) | singleton^p(sk3).
% 57141 [?] ?
% 57908 [para:57137.1.2,57139.1.1] segment^p(sk2,sk3).
% 57909 [para:57138.1.2,57139.1.2] segment^p(sk4,sk1).
% 57912 [para:57138.1.2,57140.2.1] -neq(sk4,nil) | singleton^p(sk1).
% 57913 [para:57138.1.2,57908.1.2] segment^p(sk2,sk1).
% 57914 [input:57141,cut:57913] -equalelems^p(sk1).
% 58196 [binary:56994,57011.2] equalelems^p(cons(skaf44(X),nil)).
% 58458 [binary:57133,57027.3] -segment^p(nil,sk1) | equal(nil,sk1).
% 66138 [para:57048.1.1,58196.1.1] -singleton^p(X) | -ss^list(X) | equalelems^p(X).
% 70840 [para:58458.2.2,57914.1.1,cut:56948] -segment^p(nil,sk1).
% 75791 [binary:57914,66138.3,cut:57133] -singleton^p(sk1).
% 75849 [binary:57912.2,75791] -neq(sk4,nil).
% 75855 [binary:57047,75849,cut:56955,cut:57136] equal(sk4,nil).
% 76259 [para:75855.1.1,57909.1.1,cut:70840] 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: 848
% derived clauses: 109228
% kept clauses: 59636
% kept size sum: 891286
% kept mid-nuclei: 14913
% kept new demods: 32647
% forw unit-subs: 4976
% forw double-subs: 2298
% forw overdouble-subs: 1026
% backward subs: 18
% fast unit cutoff: 2864
% full unit cutoff: 0
% dbl unit cutoff: 154
% real runtime : 30.74
% process. runtime: 30.21
% specific non-discr-tree subsumption statistics:
% tried: 326234
% length fails: 5503
% strength fails: 20437
% predlist fails: 228659
% aux str. fails: 12159
% by-lit fails: 2081
% full subs tried: 41282
% full subs fail: 39945
%
% ; 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/SWC332-1+eq_r.in")
%
%------------------------------------------------------------------------------