TSTP Solution File: SWC030-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC030-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 : art04.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 199.6s
% Output : Assurance 199.6s
% 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/SWC030-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,2,53972,4,2315,56031,5,2804,56032,1,2804,56032,50,2806,56032,40,2806,56232,0,2806,143273,3,4238,179121,4,4910,196866,5,5648,196866,5,5651,196867,1,5651,196867,50,5655,196867,40,5655,197067,0,5655,241261,3,6206,257122,4,6482,267752,5,6756,267752,5,6757,267752,1,6757,267752,50,6760,267752,40,6760,267952,0,6760,329330,3,7611,345430,4,8036,358674,62,8461,358675,5,8462,358676,1,8462,358676,50,8465,358676,40,8465,358876,0,8465,431645,3,9316,441459,4,9743,456536,5,10166,456536,5,10168,456537,1,10168,456537,50,10171,456537,40,10171,456737,0,10171,782144,3,14522,837519,4,16700,921275,5,18872,921276,1,18872,921276,50,18875,921276,40,18875,921476,0,18875,961184,3,20276)
%
%
% START OF PROOF
% 921277 [] equal(X,X).
% 921285 [] ss^list(nil).
% 921334 [] segment^p(X,X) | -ss^list(X).
% 921335 [] rearseg^p(X,nil) | -ss^list(X).
% 921336 [] rearseg^p(X,X) | -ss^list(X).
% 921350 [] equal(app(X,nil),X) | -ss^list(X).
% 921357 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 921358 [] -equal(nil,X) | rearseg^p(nil,X) | -ss^list(X).
% 921359 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 921361 [] -frontseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 921405 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 921420 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 921421 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 921430 [] -rearseg^p(Y,Z) | -rearseg^p(X,Y) | rearseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 921463 [] ss^list(sk1).
% 921464 [] ss^list(sk2).
% 921465 [] ss^list(sk3).
% 921466 [] ss^list(sk4).
% 921467 [] equal(sk2,sk4).
% 921468 [] equal(sk1,sk3).
% 921469 [] ss^list(sk5).
% 921470 [] ss^list(sk6).
% 921471 [] equal(app(sk5,sk6),sk4).
% 921472 [] equal(app(sk6,sk5),sk3).
% 921473 [] equal(nil,sk2) | equal(nil,sk1).
% 921476 [] -equal(nil,sk1) | -equal(nil,sk2).
% 922302 [binary:921466,921334.2] segment^p(sk4,sk4).
% 922303 [binary:921469,921334.2] segment^p(sk5,sk5).
% 922374 [binary:921469,921336.2] rearseg^p(sk5,sk5).
% 922407 [para:921467.1.2,922302.1.1] segment^p(sk2,sk4).
% 922524 [para:921473.1.2,922407.1.1] segment^p(nil,sk4) | equal(nil,sk1).
% 922671 [binary:921466,921357.3] -segment^p(nil,sk4) | equal(nil,sk4).
% 922689 [binary:921476,921357.2,cut:921463] -segment^p(nil,sk1) | -equal(nil,sk2).
% 922812 [binary:921470,921358.3] -equal(nil,sk6) | rearseg^p(nil,sk6).
% 922858 [binary:921469,921359.3] -rearseg^p(nil,sk5) | equal(nil,sk5).
% 925938 [binary:921471,921420,cut:921466,cut:921470,cut:921469] rearseg^p(sk4,sk6).
% 925941 [binary:921472,921420,cut:921465,cut:921469,cut:921470] rearseg^p(sk3,sk5).
% 926018 [para:921467.1.2,925938.1.1] rearseg^p(sk2,sk6).
% 926021 [para:921468.1.2,925941.1.1] rearseg^p(sk1,sk5).
% 926024 [para:921473.1.2,926018.1.1] rearseg^p(nil,sk6) | equal(nil,sk1).
% 926045 [binary:921472,921421,cut:921465,cut:921470,cut:921469] frontseg^p(sk3,sk6).
% 926126 [para:921468.1.2,926045.1.1] frontseg^p(sk1,sk6).
% 930941 [para:922524.2.2,926021.1.1] rearseg^p(nil,sk5) | segment^p(nil,sk4).
% 945593 [binary:921361.2,922812,cut:921470] -frontseg^p(nil,sk6) | rearseg^p(nil,sk6).
% 957074 [para:926024.2.2,926126.1.1,binarycut:945593] rearseg^p(nil,sk6).
% 957079 [binary:921359,957074,cut:921470] equal(nil,sk6).
% 957084 [binary:921430,957074,cut:921285,cut:921470,binarycut:921335] rearseg^p(X,sk6) | -ss^list(X).
% 957087 [para:957079.1.2,921471.1.1.2] equal(app(sk5,nil),sk4).
% 957360 [binary:921469,957084.2] rearseg^p(sk5,sk6).
% 958578 [para:957087.1.1,921350.1.1,cut:921469] equal(sk4,sk5).
% 958628 [para:958578.1.2,922303.1.2] segment^p(sk5,sk4).
% 958629 [para:958578.1.2,922374.1.1] rearseg^p(sk4,sk5).
% 958686 [para:921467.1.2,958628.1.2] segment^p(sk5,sk2).
% 958691 [para:922858.2.2,958628.1.1,binarycut:930941] segment^p(nil,sk4).
% 958695 [para:922671.2.2,958629.1.1,cut:958691] rearseg^p(nil,sk5).
% 958759 [para:922858.2.2,958686.1.1,cut:958695] segment^p(nil,sk2).
% 958777 [binary:921430,958695,cut:921285,cut:921469,binarycut:921335] rearseg^p(X,sk5) | -ss^list(X).
% 958882 [binary:921357,958759,cut:921464] equal(nil,sk2).
% 958964 [para:958882.1.2,922689.2.2,cut:921277] -segment^p(nil,sk1).
% 960894 [binary:921470,958777.2] rearseg^p(sk6,sk5).
% 960929 [binary:921405,960894,cut:957360,cut:921469,cut:921470] equal(sk5,sk6).
% 960933 [para:960929.1.2,921471.1.1.2] equal(app(sk5,sk5),sk4).
% 960934 [para:960929.1.2,921472.1.1.1,demod:960933] equal(sk4,sk3).
% 961019 [para:960934.1.1,958691.1.2] segment^p(nil,sk3).
% 961273 [para:921468.1.2,961019.1.2,cut:958964] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% 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: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9762
% derived clauses: 1568827
% kept clauses: 426409
% kept size sum: 679701
% kept mid-nuclei: 134625
% kept new demods: 37032
% forw unit-subs: 141834
% forw double-subs: 54353
% forw overdouble-subs: 42518
% backward subs: 1307
% fast unit cutoff: 154489
% full unit cutoff: 134
% dbl unit cutoff: 8832
% real runtime : 203.98
% process. runtime: 203.40
% specific non-discr-tree subsumption statistics:
% tried: 7632821
% length fails: 148649
% strength fails: 1243191
% predlist fails: 4321157
% aux str. fails: 193581
% by-lit fails: 195774
% full subs tried: 1416155
% full subs fail: 1364209
%
% ; 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/SWC030-1+eq_r.in")
%
%------------------------------------------------------------------------------