TSTP Solution File: SWC205-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC205-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 20.0s
% Output : Assurance 20.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/SWC205-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(196,40,0,392,0,1,53368,4,2209,55339,63,2803,55339,1,2803,55339,50,2805,55339,40,2805,55535,0,2805)
%
%
% START OF PROOF
% 55340 [] equal(X,X).
% 55348 [] ss^list(nil).
% 55397 [] segment^p(X,X) | -ss^list(X).
% 55420 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 55440 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 55455 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 55526 [] ss^list(sk1).
% 55527 [] ss^list(sk2).
% 55530 [] equal(sk2,sk4).
% 55531 [] equal(sk1,sk3).
% 55532 [] neq(sk2,nil).
% 55533 [] -neq(sk1,nil).
% 55534 [] -equal(nil,sk3) | equal(nil,sk4).
% 55549 [input:55455,factor:cut:55340] -neq(X,X) | -ss^list(X).
% 56303 [para:55534.2.2,55530.1.2] -equal(nil,sk3) | equal(sk2,nil).
% 56311 [para:55531.1.2,56303.1.2] -equal(nil,sk1) | equal(sk2,nil).
% 56371 [binary:55526,55397.2] segment^p(sk1,sk1).
% 57679 [binary:55527,55549.2] -neq(sk2,sk2).
% 57714 [para:56311.2.1,57679.1.2,cut:55532] -equal(nil,sk1).
% 57770 [binary:55420.2,57714,cut:55526] -segment^p(nil,sk1).
% 58182 [binary:55533,55440,cut:55348,cut:55526] equal(sk1,nil).
% 58244 [para:58182.1.1,56371.1.1,cut:57770] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 381
% derived clauses: 89545
% kept clauses: 42341
% kept size sum: 609539
% kept mid-nuclei: 14676
% kept new demods: 32381
% forw unit-subs: 4186
% forw double-subs: 1825
% forw overdouble-subs: 412
% backward subs: 16
% fast unit cutoff: 1130
% full unit cutoff: 0
% dbl unit cutoff: 136
% real runtime : 28.18
% process. runtime: 28.16
% specific non-discr-tree subsumption statistics:
% tried: 46701
% length fails: 221
% strength fails: 16125
% predlist fails: 6474
% aux str. fails: 1995
% by-lit fails: 930
% full subs tried: 19799
% full subs fail: 19064
%
% ; 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/SWC205-1+eq_r.in")
%
%------------------------------------------------------------------------------