TSTP Solution File: LCL429-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL429-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 : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% 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/SystemOnTPTP19116/LCL/LCL429-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(8,40,0,16,0,0,22,50,0,30,0,0,48,50,0,56,0,0)
%
%
% START OF PROOF
% 49 [] -c_in(X,c_^prop^log_^othms(c_minus(Y,Z,tc_set(tc_^prop^log_^opl(U))),U),tc_^prop^log_^opl(U)) | c_in(X,c_^prop^log_^othms(c_minus(V,Z,tc_set(tc_^prop^log_^opl(U))),U),tc_^prop^log_^opl(U)) | -c_lessequals(Y,V,tc_set(tc_^prop^log_^opl(U))).
% 50 [] c_lessequals(c_^prop^log_^ohyps(X,c_minus(Y,c_insert(Z,c_emptyset,U),tc_set(U)),U),c_insert(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^ovar(Z,U),c_^prop^log_^opl_^ofalse,U),c_minus(c_^prop^log_^ohyps(X,Y,U),c_insert(c_^prop^log_^opl_^ovar(Z,U),c_emptyset,tc_^prop^log_^opl(U)),tc_set(tc_^prop^log_^opl(U))),tc_^prop^log_^opl(U)),tc_set(tc_^prop^log_^opl(U))).
% 51 [] c_lessequals(c_minus(X,Y,tc_set(Z)),c_insert(U,c_minus(X,c_insert(U,Y,Z),tc_set(Z)),Z),tc_set(Z)).
% 52 [] c_lessequals(c_minus(c_insert(X,c_minus(Y,c_insert(Z,c_emptyset,U),tc_set(U)),U),V,tc_set(U)),c_insert(X,c_minus(Y,c_insert(Z,V,U),tc_set(U)),U),tc_set(U)).
% 53 [] -c_in(X,c_^prop^log_^othms(c_insert(c_^prop^log_^opl_^oop_^a_^n_62(Y,c_^prop^log_^opl_^ofalse,Z),U,tc_^prop^log_^opl(Z)),Z),tc_^prop^log_^opl(Z)) | -c_in(X,c_^prop^log_^othms(c_insert(Y,U,tc_^prop^log_^opl(Z)),Z),tc_^prop^log_^opl(Z)) | c_in(X,c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)).
% 54 [] -c_lessequals(X,Y,tc_set(tc_^prop^log_^opl(Z))) | -c_in(U,c_^prop^log_^othms(X,Z),tc_^prop^log_^opl(Z)) | c_in(U,c_^prop^log_^othms(Y,Z),tc_^prop^log_^opl(Z)).
% 55 [] c_in(v_p,c_^prop^log_^othms(c_minus(c_^prop^log_^ohyps(v_p,X,t_a),v_^f,tc_set(tc_^prop^log_^opl(t_a))),t_a),tc_^prop^log_^opl(t_a)).
% 56 [] -c_in(v_p,c_^prop^log_^othms(c_minus(c_^prop^log_^ohyps(v_p,v_t,t_a),c_insert(c_^prop^log_^opl_^ovar(v_v,t_a),v_^f,tc_^prop^log_^opl(t_a)),tc_set(tc_^prop^log_^opl(t_a))),t_a),tc_^prop^log_^opl(t_a)).
% 61 [hyper:54,51,55] c_in(v_p,c_^prop^log_^othms(c_insert(X,c_minus(c_^prop^log_^ohyps(v_p,Y,t_a),c_insert(X,v_^f,tc_^prop^log_^opl(t_a)),tc_set(tc_^prop^log_^opl(t_a))),tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 78 [hyper:49,50,55] c_in(v_p,c_^prop^log_^othms(c_minus(c_insert(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^ovar(X,t_a),c_^prop^log_^opl_^ofalse,t_a),c_minus(c_^prop^log_^ohyps(v_p,Y,t_a),c_insert(c_^prop^log_^opl_^ovar(X,t_a),c_emptyset,tc_^prop^log_^opl(t_a)),tc_set(tc_^prop^log_^opl(t_a))),tc_^prop^log_^opl(t_a)),v_^f,tc_set(tc_^prop^log_^opl(t_a))),t_a),tc_^prop^log_^opl(t_a)).
% 84 [hyper:54,78,52] c_in(v_p,c_^prop^log_^othms(c_insert(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^ovar(X,t_a),c_^prop^log_^opl_^ofalse,t_a),c_minus(c_^prop^log_^ohyps(v_p,Y,t_a),c_insert(c_^prop^log_^opl_^ovar(X,t_a),v_^f,tc_^prop^log_^opl(t_a)),tc_set(tc_^prop^log_^opl(t_a))),tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 88 [hyper:53,84,cut:61,slowcut:56] 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 7
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 28
% derived clauses: 83
% kept clauses: 4
% kept size sum: 111
% kept mid-nuclei: 41
% kept new demods: 0
% forw unit-subs: 4
% 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.2
% 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/SystemOnTPTP19116/LCL/LCL429-2+noeq.in")
%
%------------------------------------------------------------------------------