TSTP Solution File: LCL438-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL438-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 : 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 100.0s
% Output : Assurance 100.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/SystemOnTPTP19266/LCL/LCL438-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(1379,40,6,2758,0,12,377804,4,2132,390065,5,2813,390066,1,2813,390066,50,2819,390066,40,2819,391445,0,2820,427513,3,4221,428262,4,4921,436851,5,5625,436852,5,5626,436852,1,5626,436852,50,5630,436852,40,5630,438231,0,5631,460024,3,6182,465594,4,6457,469789,5,6732,469790,1,6733,469790,50,6736,469790,40,6736,471169,0,6737,509365,3,7588,542254,4,8014,551868,5,8438,551870,5,8439,551871,1,8439,551871,50,8446,551871,40,8446,553250,0,8447,578247,3,9298,587686,4,9725,593306,5,10148,593307,5,10149,593308,1,10149,593308,50,10152,593308,40,10152,594687,0,10153)
%
%
% START OF PROOF
% 594679 [] -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(X,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)).
% 594680 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^oop_^a_^n_62(Y,Z,U),U),c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,Y,U),c_^prop^log_^opl_^oop_^a_^n_62(X,Z,U),U),U),c_^prop^log_^othms(V,U),tc_^prop^log_^opl(U)).
% 594684 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_p,c_^prop^log_^opl_^oop_^a_^n_62(v_pa,v_q,t_a),t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 594686 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_pa,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 594687 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_q,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 594707 [binary:594679.2,594686] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_pa,t_a),X,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)) | c_in(X,c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 594867 [binary:594679.2,594684] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_p,c_^prop^log_^opl_^oop_^a_^n_62(v_pa,v_q,t_a),t_a),X,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)) | c_in(X,c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 596328 [binary:594687,594707.2] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_pa,t_a),c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_q,t_a),t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 611462 [binary:594680,594867,cut:596328] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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 7
% clause depth limited to 4
% seconds given: 87
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13009
% derived clauses: 1393521
% kept clauses: 250270
% kept size sum: 0
% kept mid-nuclei: 46548
% kept new demods: 147
% forw unit-subs: 155067
% forw double-subs: 25814
% forw overdouble-subs: 3381
% backward subs: 164
% fast unit cutoff: 8079
% full unit cutoff: 3077
% dbl unit cutoff: 6
% real runtime : 104.87
% process. runtime: 104.79
% specific non-discr-tree subsumption statistics:
% tried: 133975
% length fails: 9933
% strength fails: 15562
% predlist fails: 21987
% aux str. fails: 4525
% by-lit fails: 11076
% full subs tried: 48937
% full subs fail: 45544
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP19266/LCL/LCL438-1+eq_r.in")
% WARNING: TreeLimitedRun lost 99.99s, total lost is 99.99s
%
%------------------------------------------------------------------------------