TSTP Solution File: LCL239-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL239-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:42:08 EDT 2022
% Result : Unsatisfiable 1.33s 1.73s
% Output : Refutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 2 RR)
% Number of literals : 27 ( 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 : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 46 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq(A,A,B,C),B),
file('LCL239-10.p',unknown),
[] ).
cnf(2,plain,
equal(axiom(implies(or(A,A),A)),true),
file('LCL239-10.p',unknown),
[] ).
cnf(3,plain,
equal(axiom(implies(A,or(B,A))),true),
file('LCL239-10.p',unknown),
[] ).
cnf(4,plain,
equal(axiom(implies(or(A,B),or(B,A))),true),
file('LCL239-10.p',unknown),
[] ).
cnf(5,plain,
equal(axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),true),
file('LCL239-10.p',unknown),
[] ).
cnf(7,plain,
equal(or(not(A),B),implies(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(ifeq(axiom(A),true,theorem(A),true),true),
file('LCL239-10.p',unknown),
[] ).
cnf(9,plain,
equal(ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true),true),
file('LCL239-10.p',unknown),
[] ).
cnf(10,plain,
equal(not(implies(A,not(B))),and(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),1]),
[iquote('demod([7]),flip(1)')] ).
cnf(11,plain,
~ equal(theorem(not(and(p,not(p)))),true),
file('LCL239-10.p',unknown),
[] ).
cnf(14,plain,
equal(theorem(implies(or(A,A),A)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,8]),1]),
[iquote('para(2,8),demod([1])')] ).
cnf(16,plain,
equal(theorem(implies(A,or(B,A))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,8]),1]),
[iquote('para(3,8),demod([1])')] ).
cnf(24,plain,
equal(axiom(implies(implies(A,or(B,C)),or(B,implies(A,C)))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,5]),7]),
[iquote('para(7,5),demod([7])')] ).
cnf(26,plain,
equal(theorem(implies(or(A,B),or(B,A))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),1]),
[iquote('para(4,8),demod([1])')] ).
cnf(39,plain,
equal(ifeq(theorem(or(A,A)),true,theorem(A),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,9]),1]),
[iquote('para(14,9),demod([1])')] ).
cnf(49,plain,
equal(ifeq(theorem(implies(implies(A,or(B,A)),C)),true,theorem(C),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,9]),1]),
[iquote('para(16,9),demod([1])')] ).
cnf(104,plain,
equal(theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,8]),1]),
[iquote('para(24,8),demod([1])')] ).
cnf(127,plain,
equal(ifeq(theorem(or(A,B)),true,theorem(or(B,A)),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,9]),1]),
[iquote('para(26,9),demod([1])')] ).
cnf(147,plain,
equal(ifeq(theorem(implies(A,B)),true,theorem(or(B,not(A))),true),true),
inference(para,[status(thm),theory(equality)],[7,127]),
[iquote('para(7,127)')] ).
cnf(929,plain,
equal(theorem(or(A,implies(B,B))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[104,49]),1]),
[iquote('para(104,49),demod([1])')] ).
cnf(933,plain,
equal(theorem(implies(A,A)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[929,39]),1]),
[iquote('para(929,39),demod([1])')] ).
cnf(953,plain,
equal(theorem(or(A,not(A))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[933,147]),1]),
[iquote('para(933,147),demod([1])')] ).
cnf(954,plain,
equal(theorem(implies(A,not(not(A)))),true),
inference(para,[status(thm),theory(equality)],[7,953]),
[iquote('para(7,953)')] ).
cnf(1853,plain,
equal(ifeq(theorem(implies(or(A,not(A)),B)),true,theorem(B),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[953,9]),1]),
[iquote('para(953,9),demod([1])')] ).
cnf(1855,plain,
equal(theorem(not(not(or(A,not(A))))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[954,1853]),1]),
[iquote('para(954,1853),demod([1])')] ).
cnf(1856,plain,
equal(theorem(not(and(A,not(A)))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,1855]),10]),
[iquote('para(7,1855),demod([10])')] ).
cnf(1857,plain,
$false,
inference(conflict,[status(thm)],[1856,11]),
[iquote('conflict(1856,11)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : LCL239-10 : TPTP v8.1.0. Released v7.5.0.
% 0.14/0.15 % Command : tptp2X_and_run_eqp %s
% 0.15/0.37 % Computer : n026.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Mon Jul 4 15:31:07 EDT 2022
% 0.15/0.37 % CPUTime :
% 1.33/1.73 ----- EQP 0.9e, May 2009 -----
% 1.33/1.73 The job began on n026.cluster.edu, Mon Jul 4 15:31:07 2022
% 1.33/1.73 The command was "./eqp09e".
% 1.33/1.73
% 1.33/1.73 set(prolog_style_variables).
% 1.33/1.73 set(lrpo).
% 1.33/1.73 set(basic_paramod).
% 1.33/1.73 set(functional_subsume).
% 1.33/1.73 set(ordered_paramod).
% 1.33/1.73 set(prime_paramod).
% 1.33/1.73 set(para_pairs).
% 1.33/1.73 assign(pick_given_ratio,4).
% 1.33/1.73 clear(print_kept).
% 1.33/1.73 clear(print_new_demod).
% 1.33/1.73 clear(print_back_demod).
% 1.33/1.73 clear(print_given).
% 1.33/1.73 assign(max_mem,64000).
% 1.33/1.73 end_of_commands.
% 1.33/1.73
% 1.33/1.73 Usable:
% 1.33/1.73 end_of_list.
% 1.33/1.73
% 1.33/1.73 Sos:
% 1.33/1.73 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 1.33/1.73 0 (wt=-1) [] axiom(implies(or(A,A),A)) = true.
% 1.33/1.73 0 (wt=-1) [] axiom(implies(A,or(B,A))) = true.
% 1.33/1.73 0 (wt=-1) [] axiom(implies(or(A,B),or(B,A))) = true.
% 1.33/1.73 0 (wt=-1) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 1.33/1.73 0 (wt=-1) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 1.33/1.73 0 (wt=-1) [] implies(A,B) = or(not(A),B).
% 1.33/1.73 0 (wt=-1) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 1.33/1.73 0 (wt=-1) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 1.33/1.73 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 1.33/1.73 0 (wt=-1) [] -(theorem(not(and(p,not(p)))) = true).
% 1.33/1.73 end_of_list.
% 1.33/1.73
% 1.33/1.73 Demodulators:
% 1.33/1.73 end_of_list.
% 1.33/1.73
% 1.33/1.73 Passive:
% 1.33/1.73 end_of_list.
% 1.33/1.73
% 1.33/1.73 Starting to process input.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.33/1.73 1 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 1.33/1.73 2 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 1.33/1.73 3 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 1.33/1.73 4 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 1.33/1.73 5 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 1.33/1.73 6 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 1.33/1.73 7 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 1.33/1.73 8 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 1.33/1.73 9 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 1.33/1.73 10 is a new demodulator.
% 1.33/1.73
% 1.33/1.73 ** KEPT: 11 (wt=8) [] -(theorem(not(and(p,not(p)))) = true).
% 1.33/1.73 ---------------- PROOF FOUND ----------------
% 1.33/1.73 % SZS status Unsatisfiable
% 1.33/1.73
% 1.33/1.73
% 1.33/1.73 After processing input:
% 1.33/1.73
% 1.33/1.73 Usable:
% 1.33/1.73 end_of_list.
% 1.33/1.73
% 1.33/1.73 Sos:
% 1.33/1.73 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.33/1.73 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 1.33/1.73 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 1.33/1.73 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 1.33/1.73 11 (wt=8) [] -(theorem(not(and(p,not(p)))) = true).
% 1.33/1.73 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 1.33/1.73 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 1.33/1.73 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 1.33/1.73 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 1.33/1.73 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 1.33/1.73 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 1.33/1.73 end_of_list.
% 1.33/1.73
% 1.33/1.73 Demodulators:
% 1.33/1.73 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.33/1.73 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 1.33/1.73 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 1.33/1.73 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 1.33/1.73 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 1.33/1.73 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 1.33/1.73 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 1.33/1.73 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 1.33/1.73 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 1.33/1.73 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 1.33/1.73 end_of_list.
% 1.33/1.73
% 1.33/1.73 Passive:
% 1.33/1.73 end_of_list.
% 1.33/1.73
% 1.33/1.73 UNIT CONFLICT from 1856 and 11 at 0.18 seconds.
% 1.33/1.73
% 1.33/1.73 ---------------- PROOF ----------------
% 1.33/1.73 % SZS output start Refutation
% See solution above
% 1.33/1.73 ------------ end of proof -------------
% 1.33/1.73
% 1.33/1.73
% 1.33/1.73 ------------- memory usage ------------
% 1.33/1.73 Memory dynamically allocated (tp_alloc): 2929.
% 1.33/1.73 type (bytes each) gets frees in use avail bytes
% 1.33/1.73 sym_ent ( 96) 64 0 64 0 6.0 K
% 1.33/1.73 term ( 16) 303956 273226 30730 27 593.5 K
% 1.33/1.73 gen_ptr ( 8) 200600 48445 152155 26 1188.9 K
% 1.33/1.73 context ( 808) 885103 885101 2 3 3.9 K
% 1.33/1.73 trail ( 12) 11005 11005 0 6 0.1 K
% 1.33/1.73 bt_node ( 68) 454820 454817 3 17 1.3 K
% 1.33/1.73 ac_position (285432) 0 0 0 0 0.0 K
% 1.33/1.73 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.33/1.73 ac_match_free_vars_pos (4020)
% 1.33/1.73 0 0 0 0 0.0 K
% 1.33/1.73 discrim ( 12) 29098 156 28942 0 339.2 K
% 1.33/1.73 flat ( 40) 364804 364804 0 28 1.1 K
% 1.33/1.73 discrim_pos ( 12) 9458 9458 0 1 0.0 K
% 1.33/1.73 fpa_head ( 12) 15685 0 15685 0 183.8 K
% 1.33/1.73 fpa_tree ( 28) 9183 9183 0 15 0.4 K
% 1.33/1.73 fpa_pos ( 36) 3706 3706 0 1 0.0 K
% 1.33/1.73 literal ( 12) 13535 11679 1856 1 21.8 K
% 1.33/1.73 clause ( 24) 13535 11679 1856 1 43.5 K
% 1.33/1.73 list ( 12) 1909 1853 56 3 0.7 K
% 1.33/1.73 list_pos ( 20) 7438 41 7397 0 144.5 K
% 1.33/1.73 pair_index ( 40) 2 0 2 0 0.1 K
% 1.33/1.73
% 1.33/1.73 -------------- statistics -------------
% 1.33/1.73 Clauses input 11
% 1.33/1.73 Usable input 0
% 1.33/1.73 Sos input 11
% 1.33/1.73 Demodulators input 0
% 1.33/1.73 Passive input 0
% 1.33/1.73
% 1.33/1.73 Processed BS (before search) 11
% 1.33/1.73 Forward subsumed BS 0
% 1.33/1.73 Kept BS 11
% 1.33/1.73 New demodulators BS 10
% 1.33/1.73 Back demodulated BS 0
% 1.33/1.73
% 1.33/1.73 Clauses or pairs given 54144
% 1.33/1.73 Clauses generated 11661
% 1.33/1.73 Forward subsumed 9816
% 1.33/1.73 Deleted by weight 0
% 1.33/1.73 Deleted by variable count 0
% 1.33/1.73 Kept 1845
% 1.33/1.73 New demodulators 1840
% 1.33/1.73 Back demodulated 6
% 1.33/1.73 Ordered paramod prunes 0
% 1.33/1.73 Basic paramod prunes 170965
% 1.33/1.73 Prime paramod prunes 164
% 1.33/1.73 Semantic prunes 0
% 1.33/1.73
% 1.33/1.73 Rewrite attmepts 99639
% 1.33/1.73 Rewrites 9289
% 1.33/1.73
% 1.33/1.73 FPA overloads 0
% 1.33/1.73 FPA underloads 0
% 1.33/1.73
% 1.33/1.73 Usable size 0
% 1.33/1.73 Sos size 1849
% 1.33/1.73 Demodulators size 1844
% 1.33/1.73 Passive size 0
% 1.33/1.73 Disabled size 6
% 1.33/1.73
% 1.33/1.73 Proofs found 1
% 1.33/1.73
% 1.33/1.73 ----------- times (seconds) ----------- Mon Jul 4 15:31:08 2022
% 1.33/1.73
% 1.33/1.73 user CPU time 0.18 (0 hr, 0 min, 0 sec)
% 1.33/1.73 system CPU time 0.37 (0 hr, 0 min, 0 sec)
% 1.33/1.73 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.33/1.73 input time 0.00
% 1.33/1.73 paramodulation time 0.07
% 1.33/1.73 demodulation time 0.01
% 1.33/1.73 orient time 0.01
% 1.33/1.73 weigh time 0.00
% 1.33/1.73 forward subsume time 0.00
% 1.33/1.73 back demod find time 0.00
% 1.33/1.73 conflict time 0.00
% 1.33/1.73 LRPO time 0.01
% 1.33/1.73 store clause time 0.01
% 1.33/1.73 disable clause time 0.00
% 1.33/1.73 prime paramod time 0.01
% 1.33/1.73 semantics time 0.00
% 1.33/1.73
% 1.33/1.73 EQP interrupted
%------------------------------------------------------------------------------