TSTP Solution File: LCL268-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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 : 300s
% DateTime : Wed Jul 27 13:04:06 EDT 2022
% Result : Unsatisfiable 1.63s 1.84s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 32 unt; 0 nHn; 4 RR)
% Number of literals : 37 ( 6 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 61 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( theorem(A)
| ~ axiom(A) ),
file('LCL268-3.p',unknown),
[] ).
cnf(2,axiom,
( theorem(A)
| ~ theorem(implies(B,A))
| ~ theorem(B) ),
file('LCL268-3.p',unknown),
[] ).
cnf(3,axiom,
~ theorem(e_quivalent(p,p)),
file('LCL268-3.p',unknown),
[] ).
cnf(5,axiom,
axiom(implies(or(A,A),A)),
file('LCL268-3.p',unknown),
[] ).
cnf(6,axiom,
axiom(implies(A,or(B,A))),
file('LCL268-3.p',unknown),
[] ).
cnf(7,axiom,
axiom(implies(or(A,B),or(B,A))),
file('LCL268-3.p',unknown),
[] ).
cnf(8,axiom,
axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('LCL268-3.p',unknown),
[] ).
cnf(10,axiom,
implies(A,B) = or(not(A),B),
file('LCL268-3.p',unknown),
[] ).
cnf(12,plain,
or(not(A),B) = implies(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(13,axiom,
and(A,B) = not(or(not(A),not(B))),
file('LCL268-3.p',unknown),
[] ).
cnf(15,plain,
not(implies(A,not(B))) = and(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13]),12])]),
[iquote('copy,13,demod,12,flip.1')] ).
cnf(16,axiom,
e_quivalent(A,B) = and(implies(A,B),implies(B,A)),
file('LCL268-3.p',unknown),
[] ).
cnf(17,plain,
and(implies(A,B),implies(B,A)) = e_quivalent(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[16])]),
[iquote('copy,16,flip.1')] ).
cnf(19,plain,
theorem(implies(or(A,A),A)),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(20,plain,
theorem(implies(A,or(B,A))),
inference(hyper,[status(thm)],[6,1]),
[iquote('hyper,6,1')] ).
cnf(23,plain,
theorem(implies(or(A,B),or(B,A))),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(28,plain,
theorem(implies(implies(A,not(A)),not(A))),
inference(para_from,[status(thm),theory(equality)],[12,19]),
[iquote('para_from,11.1.1,19.1.1.1')] ).
cnf(36,plain,
theorem(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(hyper,[status(thm)],[8,1]),
[iquote('hyper,8,1')] ).
cnf(46,plain,
theorem(implies(implies(A,B),or(B,not(A)))),
inference(para_into,[status(thm),theory(equality)],[23,12]),
[iquote('para_into,23.1.1.1,11.1.1')] ).
cnf(47,plain,
theorem(implies(or(A,not(B)),implies(B,A))),
inference(para_into,[status(thm),theory(equality)],[23,12]),
[iquote('para_into,23.1.1.2,11.1.1')] ).
cnf(79,plain,
theorem(implies(A,and(A,A))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[46,2,28]),15,12]),
[iquote('hyper,46,2,28,demod,15,12')] ).
cnf(82,plain,
theorem(or(or(A,B),not(B))),
inference(hyper,[status(thm)],[46,2,20]),
[iquote('hyper,46,2,20')] ).
cnf(105,plain,
theorem(implies(implies(A,A),e_quivalent(A,A))),
inference(para_into,[status(thm),theory(equality)],[79,17]),
[iquote('para_into,79.1.1.2,17.1.1')] ).
cnf(116,plain,
theorem(or(A,or(or(B,C),not(C)))),
inference(hyper,[status(thm)],[82,2,20]),
[iquote('hyper,82,2,20')] ).
cnf(190,plain,
theorem(or(or(A,B),or(C,not(B)))),
inference(hyper,[status(thm)],[116,2,36]),
[iquote('hyper,116,2,36')] ).
cnf(233,plain,
theorem(or(or(A,not(B)),or(C,B))),
inference(hyper,[status(thm)],[190,2,23]),
[iquote('hyper,190,2,23')] ).
cnf(244,plain,
theorem(or(A,or(or(B,not(C)),C))),
inference(hyper,[status(thm)],[233,2,36]),
[iquote('hyper,233,2,36')] ).
cnf(249,plain,
theorem(or(or(A,not(B)),B)),
inference(hyper,[status(thm)],[244,2,19]),
[iquote('hyper,244,2,19')] ).
cnf(253,plain,
theorem(or(A,or(B,not(A)))),
inference(hyper,[status(thm)],[249,2,23]),
[iquote('hyper,249,2,23')] ).
cnf(255,plain,
theorem(or(A,or(B,not(B)))),
inference(hyper,[status(thm)],[253,2,36]),
[iquote('hyper,253,2,36')] ).
cnf(264,plain,
theorem(or(A,not(A))),
inference(hyper,[status(thm)],[255,2,19]),
[iquote('hyper,255,2,19')] ).
cnf(267,plain,
theorem(implies(A,A)),
inference(hyper,[status(thm)],[264,2,47]),
[iquote('hyper,264,2,47')] ).
cnf(272,plain,
theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[267,2,105]),
[iquote('hyper,267,2,105')] ).
cnf(273,plain,
$false,
inference(binary,[status(thm)],[272,3]),
[iquote('binary,272.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:07:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.63/1.84 ----- Otter 3.3f, August 2004 -----
% 1.63/1.84 The process was started by sandbox on n007.cluster.edu,
% 1.63/1.84 Wed Jul 27 09:07:01 2022
% 1.63/1.84 The command was "./otter". The process ID is 16374.
% 1.63/1.84
% 1.63/1.84 set(prolog_style_variables).
% 1.63/1.84 set(auto).
% 1.63/1.84 dependent: set(auto1).
% 1.63/1.84 dependent: set(process_input).
% 1.63/1.84 dependent: clear(print_kept).
% 1.63/1.84 dependent: clear(print_new_demod).
% 1.63/1.84 dependent: clear(print_back_demod).
% 1.63/1.84 dependent: clear(print_back_sub).
% 1.63/1.84 dependent: set(control_memory).
% 1.63/1.84 dependent: assign(max_mem, 12000).
% 1.63/1.84 dependent: assign(pick_given_ratio, 4).
% 1.63/1.84 dependent: assign(stats_level, 1).
% 1.63/1.84 dependent: assign(max_seconds, 10800).
% 1.63/1.84 clear(print_given).
% 1.63/1.84
% 1.63/1.84 list(usable).
% 1.63/1.84 0 [] A=A.
% 1.63/1.84 0 [] axiom(implies(or(A,A),A)).
% 1.63/1.84 0 [] axiom(implies(A,or(B,A))).
% 1.63/1.84 0 [] axiom(implies(or(A,B),or(B,A))).
% 1.63/1.84 0 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.63/1.84 0 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.63/1.84 0 [] implies(X,Y)=or(not(X),Y).
% 1.63/1.84 0 [] theorem(X)| -axiom(X).
% 1.63/1.84 0 [] theorem(X)| -theorem(implies(Y,X))| -theorem(Y).
% 1.63/1.84 0 [] and(P,Q)=not(or(not(P),not(Q))).
% 1.63/1.84 0 [] e_quivalent(P,Q)=and(implies(P,Q),implies(Q,P)).
% 1.63/1.84 0 [] -theorem(e_quivalent(p,p)).
% 1.63/1.84 end_of_list.
% 1.63/1.84
% 1.63/1.84 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.63/1.84
% 1.63/1.84 This is a Horn set with equality. The strategy will be
% 1.63/1.84 Knuth-Bendix and hyper_res, with positive clauses in
% 1.63/1.84 sos and nonpositive clauses in usable.
% 1.63/1.84
% 1.63/1.84 dependent: set(knuth_bendix).
% 1.63/1.84 dependent: set(anl_eq).
% 1.63/1.84 dependent: set(para_from).
% 1.63/1.84 dependent: set(para_into).
% 1.63/1.84 dependent: clear(para_from_right).
% 1.63/1.84 dependent: clear(para_into_right).
% 1.63/1.84 dependent: set(para_from_vars).
% 1.63/1.84 dependent: set(eq_units_both_ways).
% 1.63/1.84 dependent: set(dynamic_demod_all).
% 1.63/1.84 dependent: set(dynamic_demod).
% 1.63/1.84 dependent: set(order_eq).
% 1.63/1.84 dependent: set(back_demod).
% 1.63/1.84 dependent: set(lrpo).
% 1.63/1.84 dependent: set(hyper_res).
% 1.63/1.84 dependent: clear(order_hyper).
% 1.63/1.84
% 1.63/1.84 ------------> process usable:
% 1.63/1.84 ** KEPT (pick-wt=4): 1 [] theorem(A)| -axiom(A).
% 1.63/1.84 ** KEPT (pick-wt=8): 2 [] theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 1.63/1.84 ** KEPT (pick-wt=4): 3 [] -theorem(e_quivalent(p,p)).
% 1.63/1.84
% 1.63/1.84 ------------> process sos:
% 1.63/1.84 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.63/1.84 ** KEPT (pick-wt=6): 5 [] axiom(implies(or(A,A),A)).
% 1.63/1.84 ** KEPT (pick-wt=6): 6 [] axiom(implies(A,or(B,A))).
% 1.63/1.84 ** KEPT (pick-wt=8): 7 [] axiom(implies(or(A,B),or(B,A))).
% 1.63/1.84 ** KEPT (pick-wt=12): 8 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.63/1.84 ** KEPT (pick-wt=12): 9 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.63/1.84 ** KEPT (pick-wt=8): 11 [copy,10,flip.1] or(not(A),B)=implies(A,B).
% 1.63/1.84 ---> New Demodulator: 12 [new_demod,11] or(not(A),B)=implies(A,B).
% 1.63/1.84 ** KEPT (pick-wt=9): 14 [copy,13,demod,12,flip.1] not(implies(A,not(B)))=and(A,B).
% 1.63/1.84 ---> New Demodulator: 15 [new_demod,14] not(implies(A,not(B)))=and(A,B).
% 1.63/1.84 ** KEPT (pick-wt=11): 17 [copy,16,flip.1] and(implies(A,B),implies(B,A))=e_quivalent(A,B).
% 1.63/1.84 ---> New Demodulator: 18 [new_demod,17] and(implies(A,B),implies(B,A))=e_quivalent(A,B).
% 1.63/1.84 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.63/1.84 >>>> Starting back demodulation with 12.
% 1.63/1.84 >>>> Starting back demodulation with 15.
% 1.63/1.84 >>>> Starting back demodulation with 18.
% 1.63/1.84
% 1.63/1.84 ======= end of input processing =======
% 1.63/1.84
% 1.63/1.84 =========== start of search ===========
% 1.63/1.84
% 1.63/1.84
% 1.63/1.84 Resetting weight limit to 9.
% 1.63/1.84
% 1.63/1.84
% 1.63/1.84 Resetting weight limit to 9.
% 1.63/1.84
% 1.63/1.84 sos_size=159
% 1.63/1.84
% 1.63/1.84 -------- PROOF --------
% 1.63/1.84
% 1.63/1.84 ----> UNIT CONFLICT at 0.01 sec ----> 273 [binary,272.1,3.1] $F.
% 1.63/1.84
% 1.63/1.84 Length of proof is 23. Level of proof is 13.
% 1.63/1.84
% 1.63/1.84 ---------------- PROOF ----------------
% 1.63/1.84 % SZS status Unsatisfiable
% 1.63/1.84 % SZS output start Refutation
% See solution above
% 1.63/1.84 ------------ end of proof -------------
% 1.63/1.84
% 1.63/1.84
% 1.63/1.84 Search stopped by max_proofs option.
% 1.63/1.84
% 1.63/1.84
% 1.63/1.84 Search stopped by max_proofs option.
% 1.63/1.84
% 1.63/1.84 ============ end of search ============
% 1.63/1.84
% 1.63/1.84 -------------- statistics -------------
% 1.63/1.84 clauses given 89
% 1.63/1.84 clauses generated 1624
% 1.63/1.84 clauses kept 265
% 1.63/1.84 clauses forward subsumed 1056
% 1.63/1.84 clauses back subsumed 6
% 1.63/1.84 Kbytes malloced 4882
% 1.63/1.84
% 1.63/1.84 ----------- times (seconds) -----------
% 1.63/1.84 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.63/1.84 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.84 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.63/1.84
% 1.63/1.84 That finishes the proof of the theorem.
% 1.63/1.84
% 1.63/1.84 Process 16374 finished Wed Jul 27 09:07:02 2022
% 1.63/1.84 Otter interrupted
% 1.63/1.84 PROOF FOUND
%------------------------------------------------------------------------------