TSTP Solution File: SWC010-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC010-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 : art01.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 70.0s
% Output : Assurance 70.0s
% 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/SWC010-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(208,40,3,416,0,3,58696,4,2276,60613,63,2804,60613,1,2804,60613,50,2806,60613,40,2806,60821,0,2807,137258,3,4209,169391,4,4935,190814,5,5616,190815,5,5619,190816,1,5619,190816,50,5622,190816,40,5622,191024,0,5622,235117,3,6173,250022,4,6452,264963,5,6723,264964,5,6724,264965,1,6724,264965,50,6726,264965,40,6726,265173,0,6727)
%
%
% START OF PROOF
% 265023 [] segment^p(X,X) | -ss^list(X).
% 265066 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 265081 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 265093 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 265152 [] ss^list(sk1).
% 265153 [] ss^list(sk2).
% 265154 [] ss^list(sk3).
% 265155 [] ss^list(sk4).
% 265156 [] equal(sk2,sk4).
% 265157 [] equal(sk1,sk3).
% 265158 [] neq(sk2,nil).
% 265167 [] -neq(sk4,nil) | -equal(app(app(X,cons(Y,nil)),Z),sk2) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 265168 [] -neq(sk4,nil) | ss^item(sk5).
% 265169 [] -neq(sk4,nil) | ss^list(sk6).
% 265170 [] -neq(sk4,nil) | ss^list(sk7).
% 265171 [] equal(app(app(sk6,cons(sk5,nil)),sk7),sk4) | -neq(sk4,nil).
% 265172 [] equal(app(sk6,sk7),sk3) | -neq(sk4,nil).
% 265503 [para:265156.1.2,265168.1.1,cut:265158] ss^item(sk5).
% 265513 [para:265156.1.2,265167.1.1,cut:265158] -equal(app(app(X,cons(Y,nil)),Z),sk2) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 265550 [para:265156.1.2,265169.1.1,cut:265158] ss^list(sk6).
% 265552 [para:265156.1.2,265170.1.1,cut:265158] ss^list(sk7).
% 265554 [para:265156.1.2,265172.2.1,cut:265158] equal(app(sk6,sk7),sk3).
% 265556 [para:265156.1.2,265171.2.1,cut:265158] equal(app(app(sk6,cons(sk5,nil)),sk7),sk4).
% 265637 [binary:265155,265023.2] segment^p(sk4,sk4).
% 265708 [para:265156.1.2,265637.1.1] segment^p(sk2,sk4).
% 265709 [para:265156.1.2,265637.1.2] segment^p(sk4,sk2).
% 268754 [binary:265554,265081.2,demod:265554,cut:265154] -neq(sk3,sk3).
% 268776 [para:265157.1.2,268754.1.2] -neq(sk3,sk1).
% 268840 [binary:265066,268776,cut:265152,cut:265154] equal(sk3,sk1).
% 270336 [binary:265708,265093,cut:265709,cut:265155,cut:265153] equal(sk4,sk2).
% 296504 [para:265556.1.1,265513.1.1,demod:265554,cut:270336,cut:268840,cut:265503,cut:265550,cut:265552] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 3777
% derived clauses: 432182
% kept clauses: 206798
% kept size sum: 0
% kept mid-nuclei: 51371
% kept new demods: 34573
% forw unit-subs: 42119
% forw double-subs: 11094
% forw overdouble-subs: 9553
% backward subs: 133
% fast unit cutoff: 43833
% full unit cutoff: 0
% dbl unit cutoff: 915
% real runtime : 71.7
% process. runtime: 71.1
% specific non-discr-tree subsumption statistics:
% tried: 2562570
% length fails: 32033
% strength fails: 251448
% predlist fails: 1776193
% aux str. fails: 83246
% by-lit fails: 59816
% full subs tried: 297960
% full subs fail: 287368
%
% ; 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/SWC010-1+eq_r.in")
%
%------------------------------------------------------------------------------