TSTP Solution File: LCL440-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL440-1 : TPTP v3.4.2. Released v3.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art07.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 4.8s
% Output : Assurance 4.8s
% 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: /tmp/SystemOnTPTP29289/LCL/LCL440-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 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 7)
% (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(1375,40,6,2750,0,12)
%
%
% START OF PROOF
% 2746 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,X,Y),c_^prop^log_^othms(Z,Y),tc_^prop^log_^opl(Y)).
% 2750 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^ofalse,c_^prop^log_^opl_^ofalse,t_a),c_^prop^log_^othms(c_emptyset,t_a),tc_^prop^log_^opl(t_a)).
% 73020 [hyper:2750,2746] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 4
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1660
% derived clauses: 212211
% kept clauses: 65918
% kept size sum: 0
% kept mid-nuclei: 3056
% kept new demods: 22
% forw unit-subs: 68664
% forw double-subs: 684
% forw overdouble-subs: 199
% backward subs: 14
% fast unit cutoff: 89
% full unit cutoff: 24
% dbl unit cutoff: 1
% real runtime : 5.17
% process. runtime: 5.1
% specific non-discr-tree subsumption statistics:
% tried: 379
% length fails: 17
% strength fails: 8
% predlist fails: 7
% aux str. fails: 3
% by-lit fails: 2
% full subs tried: 338
% full subs fail: 139
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP29289/LCL/LCL440-1+eq_r.in")
% WARNING: TreeLimitedRun lost 4.81s, total lost is 4.81s
% Killed 1 orphans
%
%------------------------------------------------------------------------------