TSTP Solution File: LCL431-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL431-2 : 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 0.0s
% Output : Assurance 0.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: /tmp/SystemOnTPTP28733/LCL/LCL431-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 5 3)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0)
%
%
% START OF PROOF
% 7 [] c_in(X,c_^prop^log_^othms(c_minus(c_^prop^log_^ohyps(X,Y,Z),c_^prop^log_^ohyps(X,U,Z),tc_set(tc_^prop^log_^opl(Z))),Z),tc_^prop^log_^opl(Z)) | -c_^prop^log_^osat(c_emptyset,X,Z).
% 8 [] equal(c_minus(X,X,tc_set(Y)),c_emptyset).
% 9 [] c_^prop^log_^osat(c_emptyset,v_p,t_a).
% 10 [] -c_in(v_p,c_^prop^log_^othms(c_emptyset,t_a),tc_^prop^log_^opl(t_a)).
% 12 [binary:9,7.2] c_in(v_p,c_^prop^log_^othms(c_minus(c_^prop^log_^ohyps(v_p,X,t_a),c_^prop^log_^ohyps(v_p,Y,t_a),tc_set(tc_^prop^log_^opl(t_a))),t_a),tc_^prop^log_^opl(t_a)).
% 13 [para:8.1.1,12.1.2.1,cut:10] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6
% derived clauses: 5
% kept clauses: 1
% kept size sum: 18
% kept mid-nuclei: 0
% kept new demods: 1
% forw unit-subs: 2
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP28733/LCL/LCL431-2+eq_r.in")
%
%------------------------------------------------------------------------------