TSTP Solution File: SWC340-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC340-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/SWC340-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)
%
%
% SOS clause
% -segment^p(sk2,sk1) | -totalordered^p(sk1).
% was split for some strategies as:
% -segment^p(sk2,sk1).
% -totalordered^p(sk1).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(195,40,1,390,0,1,35096,4,1133,36896,5,1302,36897,1,1303,36897,50,1304,36897,40,1304,37092,0,1316,79612,3,1970,97583,4,2295)
%
%
% START OF PROOF
% 36925 [] ss^list(skaf68(X)).
% 36926 [] ss^list(skaf67(X)).
% 36927 [] ss^list(skaf66(X)).
% 36928 [] ss^item(skaf65(X)).
% 36929 [] ss^item(skaf64(X)).
% 36989 [] -leq(skaf64(X),skaf65(X)) | -ss^list(X) | totalordered^p(X).
% 37001 [] -lt(X,Y) | leq(X,Y) | -ss^item(X) | -ss^item(Y).
% 37062 [] equal(app(app(skaf66(X),cons(skaf64(X),skaf67(X))),cons(skaf65(X),skaf68(X))),X) | -ss^list(X) | totalordered^p(X).
% 37079 [] -equal(app(app(X,cons(Y,Z)),cons(U,V)),W) | lt(Y,U) | -ss^item(U) | -ss^item(Y) | -ss^list(W) | -ss^list(Z) | -ss^list(X) | -ss^list(V) | -strictordered^p(W).
% 37084 [] ss^list(sk1).
% 37088 [] equal(sk2,sk4).
% 37089 [] equal(sk1,sk3).
% 37090 [] segment^p(sk4,sk3).
% 37091 [] strictordered^p(sk3).
% 37092 [] -segment^p(sk2,sk1) | -totalordered^p(sk1).
% 37859 [para:37089.1.2,37091.1.1] strictordered^p(sk1).
% 37860 [para:37088.1.2,37090.1.1] segment^p(sk2,sk3).
% 37863 [para:37089.1.2,37860.1.2] segment^p(sk2,sk1).
% 37864 [binary:37092,37863] -totalordered^p(sk1).
% 39227 [binary:37084,36989.2,cut:37864] -leq(skaf64(sk1),skaf65(sk1)).
% 39776 [binary:39227,37001.2,cut:36929,cut:36928] -lt(skaf64(sk1),skaf65(sk1)).
% 47307 [binary:37084,37062.2,cut:37864] equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1).
% 103572 [binary:47307,37079,cut:39776,cut:36928,cut:36929,cut:37084,cut:36926,cut:36927,cut:36925,cut:37859] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation 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: 13
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1300
% derived clauses: 124187
% kept clauses: 80857
% kept size sum: 0
% kept mid-nuclei: 17307
% kept new demods: 19476
% forw unit-subs: 8808
% forw double-subs: 3537
% forw overdouble-subs: 2038
% backward subs: 24
% fast unit cutoff: 11594
% full unit cutoff: 0
% dbl unit cutoff: 285
% real runtime : 23.89
% process. runtime: 23.36
% specific non-discr-tree subsumption statistics:
% tried: 666826
% length fails: 17658
% strength fails: 47178
% predlist fails: 480498
% aux str. fails: 17564
% by-lit fails: 11291
% full subs tried: 74476
% full subs fail: 72183
%
% ; 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/SWC340-1+eq_r.in")
%
%------------------------------------------------------------------------------