TSTP Solution File: SWC367-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC367-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/SWC367-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,53803,4,2193,56050,5,2802,56051,1,2804,56051,50,2806,56051,40,2806,56248,0,2806)
%
%
% START OF PROOF
% 578 [?] ?
% 55816 [?] ?
% 56242 [] equal(sk2,sk4).
% 56243 [] equal(sk1,sk3).
% 56244 [] -rearseg^p(sk2,sk1).
% 56248 [] rearseg^p(sk4,sk3) | equal(nil,sk3).
% 57028 [para:56242.1.2,56248.1.1,cut:55816] equal(nil,sk3).
% 57033 [para:57028.1.2,56243.1.2] equal(sk1,nil).
% 57036 [para:57033.1.1,56244.1.2,cut:578] 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: 137
% derived clauses: 68222
% kept clauses: 40891
% kept size sum: 599143
% kept mid-nuclei: 14968
% kept new demods: 32374
% forw unit-subs: 3954
% forw double-subs: 1909
% forw overdouble-subs: 410
% backward subs: 8
% fast unit cutoff: 1401
% full unit cutoff: 0
% dbl unit cutoff: 136
% real runtime : 28.12
% process. runtime: 28.12
% specific non-discr-tree subsumption statistics:
% tried: 43816
% length fails: 221
% strength fails: 16139
% predlist fails: 3968
% aux str. fails: 1995
% by-lit fails: 930
% full subs tried: 19721
% full subs fail: 18988
%
% ; 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/SWC367-1+eq_r.in")
%
%------------------------------------------------------------------------------