TSTP Solution File: LCL186-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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:35 EDT 2022
% Result : Unsatisfiable 0.69s 1.12s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 2 RR)
% Number of literals : 10 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 18 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq(A,A,B,C),B),
file('LCL186-10.p',unknown),
[] ).
cnf(3,plain,
equal(axiom(or(not(A),or(B,A))),true),
file('LCL186-10.p',unknown),
[] ).
cnf(4,plain,
equal(axiom(or(not(or(A,B)),or(B,A))),true),
file('LCL186-10.p',unknown),
[] ).
cnf(7,plain,
equal(ifeq(axiom(A),true,theorem(A),true),true),
file('LCL186-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('LCL186-10.p',unknown),
[] ).
cnf(10,plain,
~ equal(theorem(or(not(not(p)),or(not(p),q))),true),
file('LCL186-10.p',unknown),
[] ).
cnf(13,plain,
equal(theorem(or(not(or(A,B)),or(B,A))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,7]),1]),
[iquote('para(4,7),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(133,plain,
equal(theorem(or(not(A),or(A,B))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,30]),1]),
[iquote('para(13,30),demod([1])')] ).
cnf(134,plain,
$false,
inference(conflict,[status(thm)],[133,10]),
[iquote('conflict(133,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n026.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.34 % DateTime : Mon Jul 4 04:02:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/1.12 ----- EQP 0.9e, May 2009 -----
% 0.69/1.12 The job began on n026.cluster.edu, Mon Jul 4 04:02:37 2022
% 0.69/1.12 The command was "./eqp09e".
% 0.69/1.12
% 0.69/1.12 set(prolog_style_variables).
% 0.69/1.12 set(lrpo).
% 0.69/1.12 set(basic_paramod).
% 0.69/1.12 set(functional_subsume).
% 0.69/1.12 set(ordered_paramod).
% 0.69/1.12 set(prime_paramod).
% 0.69/1.12 set(para_pairs).
% 0.69/1.12 assign(pick_given_ratio,4).
% 0.69/1.12 clear(print_kept).
% 0.69/1.12 clear(print_new_demod).
% 0.69/1.12 clear(print_back_demod).
% 0.69/1.12 clear(print_given).
% 0.69/1.12 assign(max_mem,64000).
% 0.69/1.12 end_of_commands.
% 0.69/1.12
% 0.69/1.12 Usable:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Sos:
% 0.69/1.12 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.69/1.12 0 (wt=-1) [] axiom(or(not(or(A,A)),A)) = true.
% 0.69/1.12 0 (wt=-1) [] axiom(or(not(A),or(B,A))) = true.
% 0.69/1.12 0 (wt=-1) [] axiom(or(not(or(A,B)),or(B,A))) = true.
% 0.69/1.12 0 (wt=-1) [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true.
% 0.69/1.12 0 (wt=-1) [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true.
% 0.69/1.12 0 (wt=-1) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 0.69/1.12 0 (wt=-1) [] ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true.
% 0.69/1.12 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.
% 0.69/1.12 0 (wt=-1) [] -(theorem(or(not(not(p)),or(not(p),q))) = true).
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Demodulators:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Passive:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Starting to process input.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.12 1 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 2 (wt=9) [] axiom(or(not(or(A,A)),A)) = true.
% 0.69/1.12 2 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 3 (wt=9) [] axiom(or(not(A),or(B,A))) = true.
% 0.69/1.12 3 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 4 (wt=11) [] axiom(or(not(or(A,B)),or(B,A))) = true.
% 0.69/1.12 4 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 5 (wt=15) [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true.
% 0.69/1.12 5 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 6 (wt=17) [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true.
% 0.69/1.12 6 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 7 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 0.69/1.12 7 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 8 (wt=17) [] ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true.
% 0.69/1.12 8 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** 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.
% 0.69/1.12 9 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 10 (wt=11) [] -(theorem(or(not(not(p)),or(not(p),q))) = true).
% 0.69/1.12 ---------------- PROOF FOUND ----------------
% 0.69/1.12 % SZS status Unsatisfiable
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 After processing input:
% 0.69/1.12
% 0.69/1.12 Usable:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Sos:
% 0.69/1.12 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.12 2 (wt=9) [] axiom(or(not(or(A,A)),A)) = true.
% 0.69/1.12 3 (wt=9) [] axiom(or(not(A),or(B,A))) = true.
% 0.69/1.12 7 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 0.69/1.12 4 (wt=11) [] axiom(or(not(or(A,B)),or(B,A))) = true.
% 0.69/1.12 10 (wt=11) [] -(theorem(or(not(not(p)),or(not(p),q))) = true).
% 0.69/1.12 5 (wt=15) [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true.
% 0.69/1.12 6 (wt=17) [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true.
% 0.69/1.12 8 (wt=17) [] ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true.
% 0.69/1.12 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.
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Demodulators:
% 0.69/1.12 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.12 2 (wt=9) [] axiom(or(not(or(A,A)),A)) = true.
% 0.69/1.12 3 (wt=9) [] axiom(or(not(A),or(B,A))) = true.
% 0.69/1.12 4 (wt=11) [] axiom(or(not(or(A,B)),or(B,A))) = true.
% 0.69/1.12 5 (wt=15) [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true.
% 0.69/1.12 6 (wt=17) [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true.
% 0.69/1.12 7 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 0.69/1.12 8 (wt=17) [] ifeq(theorem(A),true,ifeq(axiom(or(not(A),B)),true,theorem(B),true),true) = true.
% 0.69/1.12 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.
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Passive:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 UNIT CONFLICT from 133 and 10 at 0.01 seconds.
% 0.69/1.12
% 0.69/1.12 ---------------- PROOF ----------------
% 0.69/1.12 % SZS output start Refutation
% See solution above
% 0.69/1.12 ------------ end of proof -------------
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 ------------- memory usage ------------
% 0.69/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.69/1.12 type (bytes each) gets frees in use avail bytes
% 0.69/1.12 sym_ent ( 96) 62 0 62 0 5.8 K
% 0.69/1.12 term ( 16) 14207 12195 2012 23 39.2 K
% 0.69/1.12 gen_ptr ( 8) 12076 2638 9438 9 73.8 K
% 0.69/1.12 context ( 808) 28506 28504 2 2 3.2 K
% 0.69/1.12 trail ( 12) 629 629 0 4 0.0 K
% 0.69/1.12 bt_node ( 68) 14209 14202 7 14 1.4 K
% 0.69/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.12 ac_match_free_vars_pos (4020)
% 0.69/1.12 0 0 0 0 0.0 K
% 0.69/1.12 discrim ( 12) 2054 313 1741 0 20.4 K
% 0.69/1.12 flat ( 40) 12979 12979 0 25 1.0 K
% 0.69/1.12 discrim_pos ( 12) 377 377 0 1 0.0 K
% 0.69/1.12 fpa_head ( 12) 959 0 959 0 11.2 K
% 0.69/1.12 fpa_tree ( 28) 790 790 0 19 0.5 K
% 0.69/1.12 fpa_pos ( 36) 264 264 0 1 0.0 K
% 0.69/1.12 literal ( 12) 696 563 133 1 1.6 K
% 0.69/1.12 clause ( 24) 696 563 133 1 3.1 K
% 0.69/1.12 list ( 12) 190 134 56 3 0.7 K
% 0.69/1.12 list_pos ( 20) 559 65 494 0 9.6 K
% 0.69/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.12
% 0.69/1.12 -------------- statistics -------------
% 0.69/1.12 Clauses input 10
% 0.69/1.12 Usable input 0
% 0.69/1.12 Sos input 10
% 0.69/1.12 Demodulators input 0
% 0.69/1.12 Passive input 0
% 0.69/1.12
% 0.69/1.12 Processed BS (before search) 10
% 0.69/1.12 Forward subsumed BS 0
% 0.69/1.12 Kept BS 10
% 0.69/1.12 New demodulators BS 9
% 0.69/1.12 Back demodulated BS 0
% 0.69/1.12
% 0.69/1.12 Clauses or pairs given 1130
% 0.69/1.12 Clauses generated 554
% 0.69/1.12 Forward subsumed 431
% 0.69/1.12 Deleted by weight 0
% 0.69/1.12 Deleted by variable count 0
% 0.69/1.12 Kept 123
% 0.69/1.12 New demodulators 122
% 0.69/1.12 Back demodulated 11
% 0.69/1.12 Ordered paramod prunes 0
% 0.69/1.12 Basic paramod prunes 648
% 0.69/1.12 Prime paramod prunes 0
% 0.69/1.12 Semantic prunes 0
% 0.69/1.12
% 0.69/1.12 Rewrite attmepts 4670
% 0.69/1.12 Rewrites 377
% 0.69/1.12
% 0.69/1.12 FPA overloads 0
% 0.69/1.12 FPA underloads 0
% 0.69/1.12
% 0.69/1.12 Usable size 0
% 0.69/1.12 Sos size 121
% 0.69/1.12 Demodulators size 120
% 0.69/1.12 Passive size 0
% 0.69/1.12 Disabled size 11
% 0.69/1.12
% 0.69/1.12 Proofs found 1
% 0.69/1.12
% 0.69/1.12 ----------- times (seconds) ----------- Mon Jul 4 04:02:37 2022
% 0.69/1.12
% 0.69/1.12 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.69/1.12 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.69/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.12 input time 0.00
% 0.69/1.12 paramodulation time 0.00
% 0.69/1.12 demodulation time 0.00
% 0.69/1.12 orient time 0.00
% 0.69/1.12 weigh time 0.00
% 0.69/1.12 forward subsume time 0.00
% 0.69/1.12 back demod find time 0.00
% 0.69/1.12 conflict time 0.00
% 0.69/1.12 LRPO time 0.00
% 0.69/1.12 store clause time 0.00
% 0.69/1.12 disable clause time 0.00
% 0.69/1.12 prime paramod time 0.00
% 0.69/1.12 semantics time 0.00
% 0.69/1.12
% 0.69/1.12 EQP interrupted
%------------------------------------------------------------------------------