TSTP Solution File: LCL433-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL433-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 : 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 139.6s
% Output : Assurance 139.6s
% 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/SystemOnTPTP3896/LCL/LCL433-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,458477,4,2117,472285,5,2813,472286,1,2813,472286,50,2819,472286,40,2819,473665,0,2820,509710,3,4221,512099,4,4921,516731,5,5627,516731,5,5628,516731,1,5628,516731,50,5631,516731,40,5631,518110,0,5632,540282,3,6183,545948,4,6458,550551,5,6733,550552,5,6733,550552,1,6733,550552,50,6736,550552,40,6736,551931,0,6737,587871,3,7588,605333,4,8013,613666,5,8438,613667,5,8438,613667,1,8438,613667,50,8443,613667,40,8443,615046,0,8444,644582,3,9298,653536,4,9720,658502,5,10145,658503,5,10146,658504,1,10146,658504,50,10149,658504,40,10149,659883,0,10150)
%
%
% START OF PROOF
% 658515 [] c_in(X,c_^prop^log_^othms(Y,Z),tc_^prop^log_^opl(Z)) | -c_in(X,Y,tc_^prop^log_^opl(Z)).
% 658683 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Y,U).
% 658684 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 658691 [] c_in(X,c_insert(X,Y,Z),Z).
% 659875 [] -c_^prop^log_^osat(c_insert(X,Y,tc_^prop^log_^opl(Z)),U,Z) | c_^prop^log_^osat(Y,c_^prop^log_^opl_^oop_^a_^n_62(X,U,Z),Z).
% 659876 [] -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)).
% 659878 [] c_in(X,c_^prop^log_^othms(c_insert(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)).
% 659880 [] -c_in(v_x,v_^f,tc_^prop^log_^opl(t_a)).
% 659881 [] c_^prop^log_^osat(c_insert(v_x,v_^f,tc_^prop^log_^opl(t_a)),v_xa,t_a).
% 659882 [] -c_in(v_xa,c_^prop^log_^othms(c_insert(v_x,v_^f,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 659883 [] c_in(X,c_^prop^log_^othms(v_^f,t_a),tc_^prop^log_^opl(t_a)) | -c_^prop^log_^osat(v_^f,X,t_a).
% 659890 [binary:658684.2,659880] -c_in(v_x,c_union(X,v_^f,tc_^prop^log_^opl(t_a)),tc_^prop^log_^opl(t_a)) | c_in(v_x,X,tc_^prop^log_^opl(t_a)).
% 659919 [binary:659875,659881] c_^prop^log_^osat(v_^f,c_^prop^log_^opl_^oop_^a_^n_62(v_x,v_xa,t_a),t_a).
% 659928 [binary:659876.3,659882] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,v_xa,t_a),c_^prop^log_^othms(c_insert(v_x,v_^f,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)) | -c_in(X,c_^prop^log_^othms(c_insert(v_x,v_^f,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 660013 [binary:659919,659883.2] c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_x,v_xa,t_a),c_^prop^log_^othms(v_^f,t_a),tc_^prop^log_^opl(t_a)).
% 660240 [binary:658515.2,659890.2] -c_in(v_x,c_union(X,v_^f,tc_^prop^log_^opl(t_a)),tc_^prop^log_^opl(t_a)) | c_in(v_x,c_^prop^log_^othms(X,t_a),tc_^prop^log_^opl(t_a)).
% 660650 [binary:659878.2,660013] c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_x,v_xa,t_a),c_^prop^log_^othms(c_insert(X,v_^f,tc_^prop^log_^opl(t_a)),t_a),tc_^prop^log_^opl(t_a)).
% 703100 [binary:659928.2,660240.2,cut:660650] -c_in(v_x,c_union(c_insert(v_x,v_^f,tc_^prop^log_^opl(t_a)),v_^f,tc_^prop^log_^opl(t_a)),tc_^prop^log_^opl(t_a)).
% 759284 [binary:658683,703100,cut:658691] 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: 14690
% derived clauses: 1685123
% kept clauses: 273424
% kept size sum: 0
% kept mid-nuclei: 33739
% kept new demods: 180
% forw unit-subs: 168144
% forw double-subs: 36216
% forw overdouble-subs: 7154
% backward subs: 410
% fast unit cutoff: 7414
% full unit cutoff: 2665
% dbl unit cutoff: 262
% real runtime : 142.68
% process. runtime: 142.13
% specific non-discr-tree subsumption statistics:
% tried: 795652
% length fails: 32270
% strength fails: 148397
% predlist fails: 206168
% aux str. fails: 28096
% by-lit fails: 113818
% full subs tried: 184230
% full subs fail: 177079
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP3896/LCL/LCL433-1+eq_r.in")
% WARNING: TreeLimitedRun lost 139.56s, total lost is 139.56s
%
%------------------------------------------------------------------------------