TSTP Solution File: SWC175-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC175-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 : art03.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 89.5s
% Output : Assurance 89.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/SWC175-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,3,417,0,3,52214,4,2185,54158,5,2807,54158,1,2807,54158,50,2810,54158,40,2810,54372,0,2810,142076,3,4213,183978,4,4911,202232,5,5611,202233,5,5613,202234,1,5613,202234,50,5617,202234,40,5617,202448,0,5617,247887,3,6169,260562,4,6445,271170,5,6718,271171,5,6719,271172,1,6719,271172,50,6722,271172,40,6722,271386,0,6722,327292,3,7577,343225,4,7998,359762,5,8423,359764,5,8424,359764,1,8424,359764,50,8426,359764,40,8426,359978,0,8426,432216,3,9277,459148,4,9704)
%
%
% START OF PROOF
% 359773 [] ss^list(nil).
% 359850 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 359851 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 359867 [] neq(X,Y) | equal(X,Y) | -ss^item(Y) | -ss^item(X).
% 359876 [] -lt(X,Y) | -equal(X,Y) | -ss^item(Y) | -ss^item(X).
% 359885 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 359914 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 359946 [] -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).
% 359952 [] -neq(sk6,sk7).
% 359953 [] equal(app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9),sk1).
% 359954 [] ss^list(sk9).
% 359955 [] ss^list(sk8).
% 359956 [] ss^item(sk7).
% 359957 [] ss^item(sk6).
% 359959 [] strictordered^p(sk3).
% 359962 [] equal(sk1,sk3).
% 359967 [] ss^list(sk1).
% 360030 [binary:359885.3,359954] equal(app(cons(X,nil),sk9),cons(X,sk9)) | -ss^item(X).
% 360071 [binary:359914.3,359954] equal(app(app(X,Y),sk9),app(X,app(Y,sk9))) | -ss^list(Y) | -ss^list(X).
% 360172 [binary:359850.2,359955] ss^list(app(sk8,X)) | -ss^list(X).
% 360338 [binary:359851.2,359956] ss^list(cons(sk7,X)) | -ss^list(X).
% 360438 [binary:359851.2,359957] ss^list(cons(sk6,X)) | -ss^list(X).
% 361384 [binary:359867,359952,cut:359956,cut:359957] equal(sk6,sk7).
% 361389 [para:359962.1.2,359959.1.1] strictordered^p(sk1).
% 362983 [binary:359876.2,361384,cut:359956,cut:359957] -lt(sk6,sk7).
% 381666 [binary:359956,360030.2] equal(app(cons(sk7,nil),sk9),cons(sk7,sk9)).
% 396682 [para:360071.1.1,359953.1.1,demod:381666,binarydemod:360338,360438,360172,cut:359773] equal(app(app(sk8,cons(sk6,nil)),cons(sk7,sk9)),sk1).
% 462143 [binary:396682,359946,cut:362983,cut:359956,cut:359957,cut:359967,cut:359773,cut:359955,cut:359954,cut:361389] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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: 4988
% derived clauses: 669168
% kept clauses: 308813
% kept size sum: 0
% kept mid-nuclei: 62192
% kept new demods: 34668
% forw unit-subs: 63377
% forw double-subs: 18604
% forw overdouble-subs: 13057
% backward subs: 74
% fast unit cutoff: 52735
% full unit cutoff: 0
% dbl unit cutoff: 1443
% real runtime : 97.98
% process. runtime: 97.40
% specific non-discr-tree subsumption statistics:
% tried: 4253900
% length fails: 12696
% strength fails: 546202
% predlist fails: 2912131
% aux str. fails: 120490
% by-lit fails: 85527
% full subs tried: 501129
% full subs fail: 486979
%
% ; 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/SWC175-1+eq_r.in")
%
%------------------------------------------------------------------------------