TSTP Solution File: LCL218-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL218-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 09:41:54 EDT 2022
% Result : Unsatisfiable 140.42s 140.86s
% Output : Refutation 140.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 2 RR)
% Number of literals : 21 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 43 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq(A,A,B,C),B),
file('LCL218-10.p',unknown),
[] ).
cnf(2,plain,
equal(axiom(or(not(or(A,A)),A)),true),
file('LCL218-10.p',unknown),
[] ).
cnf(3,plain,
equal(axiom(or(not(A),or(B,A))),true),
file('LCL218-10.p',unknown),
[] ).
cnf(4,plain,
equal(axiom(or(not(or(A,B)),or(B,A))),true),
file('LCL218-10.p',unknown),
[] ).
cnf(5,plain,
equal(axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),true),
file('LCL218-10.p',unknown),
[] ).
cnf(7,plain,
equal(ifeq(axiom(A),true,theorem(A),true),true),
file('LCL218-10.p',unknown),
[] ).
cnf(8,plain,
equal(ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true),true),
file('LCL218-10.p',unknown),
[] ).
cnf(9,plain,
equal(ifeq(theorem(or(not(A),B)),true,ifeq(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true),true),
file('LCL218-10.p',unknown),
[] ).
cnf(10,plain,
~ equal(theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),true),
file('LCL218-10.p',unknown),
[] ).
cnf(12,plain,
equal(theorem(or(not(A),or(B,A))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,7]),1]),
[iquote('para(3,7),demod([1])')] ).
cnf(16,plain,
equal(ifeq(theorem(or(A,A)),true,theorem(A),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,8]),1]),
[iquote('para(2,8),demod([1])')] ).
cnf(23,plain,
equal(ifeq(theorem(or(A,or(B,C))),true,theorem(or(B,or(A,C))),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,8]),1]),
[iquote('para(5,8),demod([1])')] ).
cnf(30,plain,
equal(ifeq(theorem(or(not(or(A,B)),C)),true,theorem(or(not(B),C)),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,9]),1]),
[iquote('para(3,9),demod([1])')] ).
cnf(32,plain,
equal(ifeq(theorem(or(not(or(A,B)),C)),true,theorem(or(not(or(B,A)),C)),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,9]),1]),
[iquote('para(4,9),demod([1])')] ).
cnf(92,plain,
equal(theorem(or(A,or(not(B),B))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,23]),1]),
[iquote('para(12,23),demod([1])')] ).
cnf(97,plain,
equal(theorem(or(not(A),A)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[92,16]),1]),
[iquote('para(92,16),demod([1])')] ).
cnf(334,plain,
equal(theorem(or(A,or(not(or(A,B)),B))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[97,23]),1]),
[iquote('para(97,23),demod([1])')] ).
cnf(2503,plain,
equal(theorem(or(not(or(A,B)),or(not(or(not(or(B,A)),C)),C))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[334,32]),1]),
[iquote('para(334,32),demod([1])')] ).
cnf(31774,plain,
equal(theorem(or(not(A),or(not(or(not(or(A,B)),C)),C))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2503,30]),1]),
[iquote('para(2503,30),demod([1])')] ).
cnf(34025,plain,
equal(theorem(or(not(or(not(or(A,B)),C)),or(not(A),C))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31774,23]),1]),
[iquote('para(31774,23),demod([1])')] ).
cnf(34026,plain,
$false,
inference(conflict,[status(thm)],[34025,10]),
[iquote('conflict(34025,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL218-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 18:25:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 140.42/140.86 ----- EQP 0.9e, May 2009 -----
% 140.42/140.86 The job began on n023.cluster.edu, Mon Jul 4 18:25:43 2022
% 140.42/140.86 The command was "./eqp09e".
% 140.42/140.86
% 140.42/140.86 set(prolog_style_variables).
% 140.42/140.86 set(lrpo).
% 140.42/140.86 set(basic_paramod).
% 140.42/140.86 set(functional_subsume).
% 140.42/140.86 set(ordered_paramod).
% 140.42/140.86 set(prime_paramod).
% 140.42/140.86 set(para_pairs).
% 140.42/140.86 assign(pick_given_ratio,4).
% 140.42/140.86 clear(print_kept).
% 140.42/140.86 clear(print_new_demod).
% 140.42/140.86 clear(print_back_demod).
% 140.42/140.86 clear(print_given).
% 140.42/140.86 assign(max_mem,64000).
% 140.42/140.86 end_of_commands.
% 140.42/140.86
% 140.42/140.86 Usable:
% 140.42/140.86 end_of_list.
% 140.42/140.86
% 140.42/140.86 Sos:
% 140.42/140.86 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 140.42/140.86 0 (wt=-1) [] axiom(or(not(or(A,A)),A)) = true.
% 140.42/140.86 0 (wt=-1) [] axiom(or(not(A),or(B,A))) = true.
% 140.42/140.86 0 (wt=-1) [] axiom(or(not(or(A,B)),or(B,A))) = true.
% 140.42/140.86 0 (wt=-1) [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true.
% 140.42/140.86 0 (wt=-1) [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true.
% 140.42/140.86 0 (wt=-1) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 140.42/140.86 0 (wt=-1) [] ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true.
% 140.42/140.86 0 (wt=-1) [] ifeq(theorem(or(not(A),B)),true,ifeq(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true) = true.
% 140.42/140.86 0 (wt=-1) [] -(theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) = true).
% 140.42/140.86 end_of_list.
% 140.42/140.86
% 140.42/140.86 Demodulators:
% 140.42/140.86 end_of_list.
% 140.42/140.86
% 140.42/140.86 Passive:
% 140.42/140.86 end_of_list.
% 140.42/140.86
% 140.42/140.86 Starting to process input.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 140.42/140.86 1 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 2 (wt=9) [] axiom(or(not(or(A,A)),A)) = true.
% 140.42/140.86 2 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 3 (wt=9) [] axiom(or(not(A),or(B,A))) = true.
% 140.42/140.86 3 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 4 (wt=11) [] axiom(or(not(or(A,B)),or(B,A))) = true.
% 140.42/140.86 4 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 5 (wt=15) [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true.
% 140.42/140.86 5 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 6 (wt=17) [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true.
% 140.42/140.86 6 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 7 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 140.42/140.86 7 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 8 (wt=17) [] ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true.
% 140.42/140.86 8 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 9 (wt=23) [] ifeq(theorem(or(not(A),B)),true,ifeq(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true) = true.
% 140.42/140.86 9 is a new demodulator.
% 140.42/140.86
% 140.42/140.86 ** KEPT: 10 (wt=15) [] -(theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) = true).
% 140.42/140.86 ---------------- PROOF FOUND ----------------
% 140.42/140.86 % SZS status Unsatisfiable
% 140.42/140.86
% 140.42/140.86
% 140.42/140.86 After processing input:
% 140.42/140.86
% 140.42/140.86 Usable:
% 140.42/140.86 end_of_list.
% 140.42/140.86
% 140.42/140.86 Sos:
% 140.42/140.86 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 140.42/140.86 2 (wt=9) [] axiom(or(not(or(A,A)),A)) = true.
% 140.42/140.86 3 (wt=9) [] axiom(or(not(A),or(B,A))) = true.
% 140.42/140.86 7 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 140.42/140.86 4 (wt=11) [] axiom(or(not(or(A,B)),or(B,A))) = true.
% 140.42/140.86 5 (wt=15) [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true.
% 140.42/140.86 10 (wt=15) [] -(theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) = true).
% 140.42/140.86 6 (wt=17) [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true.
% 140.42/140.86 8 (wt=17) [] ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true.
% 140.42/140.86 9 (wt=23) [] ifeq(theorem(or(not(A),B)),true,ifeq(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true) = true.
% 140.42/140.86 end_of_list.
% 140.42/140.86
% 140.42/140.86 Demodulators:
% 140.42/140.86 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 140.42/140.86 2 (wt=9) [] axiom(or(not(or(A,A)),A)) = true.
% 140.42/140.86 3 (wt=9) [] axiom(or(not(A),or(B,A))) = true.
% 140.42/140.86 4 (wt=11) [] axiom(or(not(or(A,B)),or(B,A))) = true.
% 140.42/140.86 5 (wt=15) [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true.
% 140.42/140.86 6 (wt=17) [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true.
% 140.42/140.86 7 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 140.42/140.86 8 (wt=17) [] ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true.
% 140.42/140.86 9 (wt=23) [] ifeq(theorem(or(not(A),B)),true,ifeq(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true) = true.
% 140.42/140.86 end_of_list.
% 140.42/140.86
% 140.42/140.86 Passive:
% 140.42/140.86 end_of_list.
% 140.42/140.86
% 140.42/140.86 UNIT CONFLICT from 34025 and 10 at 51.04 seconds.
% 140.42/140.86
% 140.42/140.86 ---------------- PROOF ----------------
% 140.42/140.86 % SZS output start Refutation
% See solution above
% 140.42/140.86 ------------ end of proof -------------
% 140.42/140.86
% 140.42/140.86
% 140.42/140.86 ------------- memory usage ------------
% 140.42/140.86 Memory dynamically allocated (tp_alloc): 57128.
% 140.42/140.86 type (bytes each) gets frees in use avail bytes
% 140.42/140.86 sym_ent ( 96) 62 0 62 0 5.8 K
% 140.42/140.86 term ( 16) 185935694 185223334 712360 32 13781.0 K
% 140.42/140.86 gen_ptr ( 8) 24502582 20374669 4127913 20 32249.5 K
% 140.42/140.86 context ( 808) 495783527 495783525 2 2 3.2 K
% 140.42/140.86 trail ( 12) 1230274 1230274 0 8 0.1 K
% 140.42/140.86 bt_node ( 68) 256871247 256871241 6 34 2.7 K
% 140.42/140.86 ac_position (285432) 0 0 0 0 0.0 K
% 140.42/140.86 ac_match_pos (14044) 0 0 0 0 0.0 K
% 140.42/140.86 ac_match_free_vars_pos (4020)
% 140.42/140.86 0 0 0 0 0.0 K
% 140.42/140.86 discrim ( 12) 428938 791 428147 0 5017.3 K
% 140.42/140.86 flat ( 40) 110790451 110790451 0 83 3.2 K
% 140.42/140.86 discrim_pos ( 12) 464202 464202 0 1 0.0 K
% 140.42/140.86 fpa_head ( 12) 14995 0 14995 0 175.7 K
% 140.42/140.86 fpa_tree ( 28) 205520 205520 0 19 0.5 K
% 140.42/140.86 fpa_pos ( 36) 68048 68048 0 1 0.0 K
% 140.42/140.86 literal ( 12) 6445373 6411348 34025 1 398.7 K
% 140.42/140.86 clause ( 24) 6445373 6411348 34025 1 797.5 K
% 140.42/140.86 list ( 12) 34082 34026 56 3 0.7 K
% 140.42/140.86 list_pos ( 20) 136187 215 135972 0 2655.7 K
% 140.42/140.86 pair_index ( 40) 2 0 2 0 0.1 K
% 140.42/140.86
% 140.42/140.86 -------------- statistics -------------
% 140.42/140.86 Clauses input 10
% 140.42/140.86 Usable input 0
% 140.42/140.86 Sos input 10
% 140.42/140.86 Demodulators input 0
% 140.42/140.86 Passive input 0
% 140.42/140.86
% 140.42/140.86 Processed BS (before search) 10
% 140.42/140.86 Forward subsumed BS 0
% 140.42/140.86 Kept BS 10
% 140.42/140.86 New demodulators BS 9
% 140.42/140.86 Back demodulated BS 0
% 140.42/140.86
% 140.42/140.86 Clauses or pairs given 14640414
% 140.42/140.86 Clauses generated 6411339
% 140.42/140.86 Forward subsumed 6377324
% 140.42/140.86 Deleted by weight 0
% 140.42/140.86 Deleted by variable count 0
% 140.42/140.86 Kept 34015
% 140.42/140.86 New demodulators 34014
% 140.42/140.86 Back demodulated 41
% 140.42/140.86 Ordered paramod prunes 0
% 140.42/140.86 Basic paramod prunes 24330710
% 140.42/140.86 Prime paramod prunes 0
% 140.42/140.86 Semantic prunes 0
% 140.42/140.86
% 140.42/140.86 Rewrite attmepts 26388531
% 140.42/140.86 Rewrites 464202
% 140.42/140.86
% 140.42/140.86 FPA overloads 0
% 140.42/140.86 FPA underloads 0
% 140.42/140.86
% 140.42/140.86 Usable size 0
% 140.42/140.86 Sos size 33983
% 140.42/140.86 Demodulators size 33982
% 140.42/140.86 Passive size 0
% 140.42/140.86 Disabled size 41
% 140.42/140.86
% 140.42/140.86 Proofs found 1
% 140.42/140.86
% 140.42/140.86 ----------- times (seconds) ----------- Mon Jul 4 18:28:03 2022
% 140.42/140.86
% 140.42/140.86 user CPU time 51.04 (0 hr, 0 min, 51 sec)
% 140.42/140.86 system CPU time 88.74 (0 hr, 1 min, 28 sec)
% 140.42/140.86 wall-clock time 140 (0 hr, 2 min, 20 sec)
% 140.42/140.86 input time 0.00
% 140.42/140.86 paramodulation time 19.59
% 140.42/140.86 demodulation time 1.92
% 140.42/140.86 orient time 5.43
% 140.42/140.86 weigh time 1.08
% 140.42/140.86 forward subsume time 1.12
% 140.42/140.86 back demod find time 2.76
% 140.42/140.86 conflict time 0.01
% 140.42/140.86 LRPO time 2.15
% 140.42/140.86 store clause time 5.33
% 140.42/140.86 disable clause time 0.01
% 140.42/140.86 prime paramod time 4.87
% 140.42/140.86 semantics time 0.00
% 140.42/140.86
% 140.42/140.86 EQP interrupted
%------------------------------------------------------------------------------