TSTP Solution File: LCL442-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL442-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 : art10.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/SystemOnTPTP4202/LCL/LCL442-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 4 5)
% (binary-unit 10 #f 4 5)
% (binary-double 16 #f 4 5)
% (binary 54 #t 4 5)
% (binary-order 27 #f 4 5)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(12,40,0,24,0,0)
%
%
% START OF PROOF
% 13 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^ofalse,Y),c_^prop^log_^othms(Z,Y),tc_^prop^log_^opl(Y)) | c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,U,Y),c_^prop^log_^othms(Z,Y),tc_^prop^log_^opl(Y)).
% 14 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,Y,Z),c_^prop^log_^opl_^ofalse,Z),c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)) | -c_in(c_^prop^log_^opl_^oop_^a_^n_62(Y,c_^prop^log_^opl_^ofalse,Z),c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)) | -c_in(X,c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)).
% 15 [] c_in(X,c_^prop^log_^othms(c_union(Y,Z,tc_^prop^log_^opl(U)),U),tc_^prop^log_^opl(U)) | -c_in(X,c_^prop^log_^othms(Y,U),tc_^prop^log_^opl(U)).
% 16 [] c_in(X,c_^prop^log_^othms(c_union(Y,Z,tc_^prop^log_^opl(U)),U),tc_^prop^log_^opl(U)) | -c_in(X,c_^prop^log_^othms(Z,U),tc_^prop^log_^opl(U)).
% 17 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,Y,Z),c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)) | -c_in(Y,c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)).
% 18 [] c_in(v_pl1,c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)) | -c_^prop^log_^oeval(v_tt,v_pl1,t_a).
% 19 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_pl1,c_^prop^log_^opl_^ofalse,t_a),c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)) | c_^prop^log_^oeval(v_tt,v_pl1,t_a).
% 20 [] c_in(v_pl2,c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl2,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)) | -c_^prop^log_^oeval(v_tt,v_pl2,t_a).
% 21 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_pl2,c_^prop^log_^opl_^ofalse,t_a),c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl2,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)) | c_^prop^log_^oeval(v_tt,v_pl2,t_a).
% 22 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_pl1,v_pl2,t_a),c_^prop^log_^othms(c_union(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),c_^prop^log_^ohyps(v_pl2,v_tt,t_a),tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)) | c_^prop^log_^oeval(v_tt,v_pl1,t_a).
% 23 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_pl1,v_pl2,t_a),c_^prop^log_^othms(c_union(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),c_^prop^log_^ohyps(v_pl2,v_tt,t_a),tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)) | -c_^prop^log_^oeval(v_tt,v_pl2,t_a).
% 24 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_pl1,v_pl2,t_a),c_^prop^log_^opl_^ofalse,t_a),c_^prop^log_^othms(c_union(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),c_^prop^log_^ohyps(v_pl2,v_tt,t_a),tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)) | -c_^prop^log_^oeval(v_tt,v_pl1,t_a) | c_^prop^log_^oeval(v_tt,v_pl2,t_a).
% 31 [hyper:13,19] c_^prop^log_^oeval(v_tt,v_pl1,t_a) | c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_pl1,X,t_a),c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)).
% 43 [hyper:15,31] c_^prop^log_^oeval(v_tt,v_pl1,t_a) | c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_pl1,X,t_a),c_^prop^log_^othms(c_union(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),Y,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 49 [hyper:13,21] c_^prop^log_^oeval(v_tt,v_pl2,t_a) | c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_pl2,X,t_a),c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl2,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)).
% 62 [hyper:16,49] c_^prop^log_^oeval(v_tt,v_pl2,t_a) | c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_pl2,X,t_a),c_^prop^log_^othms(c_union(Y,c_^prop^log_^ohyps(v_pl2,v_tt,t_a),tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 82 [hyper:22,43] c_^prop^log_^oeval(v_tt,v_pl1,t_a).
% 84 [hyper:18,82] c_in(v_pl1,c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)).
% 88 [hyper:15,84] c_in(v_pl1,c_^prop^log_^othms(c_union(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),X,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 123 [hyper:14,62,88] c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_pl1,v_pl2,t_a),c_^prop^log_^opl_^ofalse,t_a),c_^prop^log_^othms(c_union(c_^prop^log_^ohyps(v_pl1,v_tt,t_a),c_^prop^log_^ohyps(v_pl2,v_tt,t_a),tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)) | c_^prop^log_^oeval(v_tt,v_pl2,t_a).
% 285 [hyper:24,123,cut:82] c_^prop^log_^oeval(v_tt,v_pl2,t_a).
% 287 [hyper:20,285] c_in(v_pl2,c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl2,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)).
% 296 [hyper:17,287] c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,v_pl2,t_a),c_^prop^log_^othms(c_^prop^log_^ohyps(v_pl2,v_tt,t_a),t_a),tc_^prop^log_^opl(t_a)).
% 300 [hyper:16,296] c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,v_pl2,t_a),c_^prop^log_^othms(c_union(Y,c_^prop^log_^ohyps(v_pl2,v_tt,t_a),tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 312 [hyper:23,300,cut:285] 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 5
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 74
% derived clauses: 1127
% kept clauses: 131
% kept size sum: 3255
% kept mid-nuclei: 118
% kept new demods: 0
% forw unit-subs: 91
% forw double-subs: 344
% forw overdouble-subs: 0
% backward subs: 48
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 38
% length fails: 0
% strength fails: 0
% predlist fails: 9
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 29
% full subs fail: 26
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP4202/LCL/LCL442-2+noeq.in")
%
%------------------------------------------------------------------------------