TSTP Solution File: SWC220-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC220-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 79.5s
% Output : Assurance 79.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/SWC220-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(203,40,1,406,0,1,61437,4,2206,83883,5,2802,83884,1,2804,83884,50,2808,83884,40,2808,84087,0,2808,182141,3,4209,222630,4,4911,240623,5,5609,240623,5,5610,240623,1,5610,240623,50,5613,240623,40,5613,240826,0,5613,282900,3,6164,297530,4,6439,312075,5,6714,312076,5,6715,312077,1,6715,312077,50,6717,312077,40,6717,312280,0,6718,378366,3,7570)
%
%
% START OF PROOF
% 244269 [?] ?
% 254113 [?] ?
% 312269 [] equal(sk1,sk3).
% 312271 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | ss^item(sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 312272 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | member^p(X,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 312273 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | member^p(Z,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 312274 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | leq(Y,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 312275 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | -leq(sk5(Z,X,Y),Y) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 312276 [] equal(nil,sk3) | ss^item(sk6).
% 312277 [] equal(nil,sk3) | ss^list(sk7).
% 312278 [] equal(nil,sk3) | ss^list(sk8).
% 312279 [] equal(app(app(sk7,cons(sk6,nil)),sk8),sk3) | equal(nil,sk3).
% 312280 [] equal(nil,sk3) | -member^p(sk8,X) | -member^p(sk7,X) | -leq(sk6,X) | leq(X,sk6) | -ss^item(X).
% 312628 [para:312276.1.2,312269.1.2,cut:254113] ss^item(sk6).
% 312698 [para:312277.1.2,312269.1.2,cut:254113] ss^list(sk7).
% 312815 [para:312278.1.2,312269.1.2,cut:254113] ss^list(sk8).
% 312837 [para:312279.2.2,312269.1.2,cut:254113] equal(app(app(sk7,cons(sk6,nil)),sk8),sk3).
% 312838 [para:312279.1.1,312271.1.1,cut:244269,cut:312628,cut:312815,cut:312698] ss^item(sk5(sk8,sk7,sk6)) | equal(nil,sk3).
% 312864 [para:312280.1.2,312269.1.2,cut:254113] -member^p(sk8,X) | -member^p(sk7,X) | -leq(sk6,X) | leq(X,sk6) | -ss^item(X).
% 312924 [para:312838.2.2,312269.1.2,cut:254113] ss^item(sk5(sk8,sk7,sk6)).
% 313080 [para:312837.1.1,312272.1.1,cut:244269,cut:312628,cut:312815,cut:312698] member^p(sk7,sk5(sk8,sk7,sk6)).
% 313081 [para:312837.1.1,312273.1.1,cut:244269,cut:312628,cut:312815,cut:312698] member^p(sk8,sk5(sk8,sk7,sk6)).
% 313082 [para:312837.1.1,312274.1.1,cut:244269,cut:312628,cut:312815,cut:312698] leq(sk6,sk5(sk8,sk7,sk6)).
% 313083 [para:312837.1.1,312275.1.1,cut:244269,cut:312628,cut:312815,cut:312698] -leq(sk5(sk8,sk7,sk6),sk6).
% 388004 [binary:312924,312864.5,cut:313083,cut:313082,cut:313080,cut:313081] 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 double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4605
% derived clauses: 790771
% kept clauses: 231728
% kept size sum: 0
% kept mid-nuclei: 48275
% kept new demods: 32587
% forw unit-subs: 40434
% forw double-subs: 16939
% forw overdouble-subs: 9269
% backward subs: 88
% fast unit cutoff: 35157
% full unit cutoff: 0
% dbl unit cutoff: 1095
% real runtime : 80.19
% process. runtime: 79.64
% specific non-discr-tree subsumption statistics:
% tried: 4004532
% length fails: 32618
% strength fails: 369662
% predlist fails: 3085677
% aux str. fails: 71653
% by-lit fails: 24033
% full subs tried: 361193
% full subs fail: 350957
%
% ; 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/SWC220-1+eq_r.in")
%
%------------------------------------------------------------------------------