TSTP Solution File: SWC051-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC051-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 : art06.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/SWC051-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(197,40,1,394,0,1,53375,4,2198,55301,63,2803,55301,1,2803,55301,50,2805,55301,40,2805,55498,0,2805)
%
%
% START OF PROOF
% 399 [?] ?
% 55488 [] ss^list(sk1).
% 55492 [] equal(sk2,sk4).
% 55493 [] equal(sk1,sk3).
% 55494 [] neq(sk2,nil).
% 55495 [] -neq(X,nil) | -rearseg^p(sk2,X) | -rearseg^p(sk1,X) | -ss^list(X).
% 55497 [] -neq(sk4,nil) | neq(sk3,nil).
% 55498 [] -neq(sk4,nil) | rearseg^p(sk4,sk3).
% 56280 [para:55492.1.2,55497.1.1,cut:55494] neq(sk3,nil).
% 56286 [para:55492.1.2,55498.1.1,cut:55494] rearseg^p(sk4,sk3).
% 56294 [para:55493.1.2,56280.1.1] neq(sk1,nil).
% 56303 [para:55492.1.2,56286.1.1] rearseg^p(sk2,sk3).
% 56308 [binary:55495,56294,cut:399,cut:55488] -rearseg^p(sk2,sk1).
% 56311 [para:55493.1.2,56303.1.2,cut:56308] 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: 140
% derived clauses: 88474
% kept clauses: 40395
% kept size sum: 594847
% kept mid-nuclei: 14739
% kept new demods: 32313
% forw unit-subs: 3857
% forw double-subs: 1901
% forw overdouble-subs: 430
% backward subs: 6
% fast unit cutoff: 1126
% full unit cutoff: 0
% dbl unit cutoff: 136
% real runtime : 28.10
% process. runtime: 28.10
% specific non-discr-tree subsumption statistics:
% tried: 43799
% length fails: 221
% strength fails: 16114
% predlist fails: 3909
% aux str. fails: 1995
% by-lit fails: 934
% full subs tried: 19776
% full subs fail: 19031
%
% ; 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/SWC051-1+eq_r.in")
%
%------------------------------------------------------------------------------