TSTP Solution File: LCL239-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL239-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:01 EDT 2022
% Result : Unsatisfiable 1.72s 1.92s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 26 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 4 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 : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 52 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( theorem(A)
| ~ axiom(A) ),
file('LCL239-3.p',unknown),
[] ).
cnf(2,axiom,
( theorem(A)
| ~ theorem(implies(B,A))
| ~ theorem(B) ),
file('LCL239-3.p',unknown),
[] ).
cnf(3,axiom,
~ theorem(not(and(p,not(p)))),
file('LCL239-3.p',unknown),
[] ).
cnf(5,axiom,
axiom(implies(or(A,A),A)),
file('LCL239-3.p',unknown),
[] ).
cnf(6,axiom,
axiom(implies(A,or(B,A))),
file('LCL239-3.p',unknown),
[] ).
cnf(7,axiom,
axiom(implies(or(A,B),or(B,A))),
file('LCL239-3.p',unknown),
[] ).
cnf(8,axiom,
axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('LCL239-3.p',unknown),
[] ).
cnf(10,axiom,
implies(A,B) = or(not(A),B),
file('LCL239-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('LCL239-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,plain,
theorem(implies(or(A,A),A)),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(17,plain,
theorem(implies(A,or(B,A))),
inference(hyper,[status(thm)],[6,1]),
[iquote('hyper,6,1')] ).
cnf(20,plain,
theorem(implies(or(A,B),or(B,A))),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(33,plain,
theorem(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(hyper,[status(thm)],[8,1]),
[iquote('hyper,8,1')] ).
cnf(43,plain,
theorem(implies(implies(A,B),or(B,not(A)))),
inference(para_into,[status(thm),theory(equality)],[20,12]),
[iquote('para_into,20.1.1.1,11.1.1')] ).
cnf(79,plain,
theorem(or(or(A,B),not(B))),
inference(hyper,[status(thm)],[43,2,17]),
[iquote('hyper,43,2,17')] ).
cnf(108,plain,
theorem(or(A,or(or(B,C),not(C)))),
inference(hyper,[status(thm)],[79,2,17]),
[iquote('hyper,79,2,17')] ).
cnf(167,plain,
theorem(or(or(A,B),or(C,not(B)))),
inference(hyper,[status(thm)],[108,2,33]),
[iquote('hyper,108,2,33')] ).
cnf(205,plain,
theorem(or(or(A,not(B)),or(C,B))),
inference(hyper,[status(thm)],[167,2,20]),
[iquote('hyper,167,2,20')] ).
cnf(276,plain,
theorem(or(A,or(or(B,not(C)),C))),
inference(hyper,[status(thm)],[205,2,33]),
[iquote('hyper,205,2,33')] ).
cnf(281,plain,
theorem(or(or(A,not(B)),B)),
inference(hyper,[status(thm)],[276,2,16]),
[iquote('hyper,276,2,16')] ).
cnf(285,plain,
theorem(or(A,or(B,not(A)))),
inference(hyper,[status(thm)],[281,2,20]),
[iquote('hyper,281,2,20')] ).
cnf(287,plain,
theorem(or(A,or(B,not(B)))),
inference(hyper,[status(thm)],[285,2,33]),
[iquote('hyper,285,2,33')] ).
cnf(296,plain,
theorem(or(A,not(A))),
inference(hyper,[status(thm)],[287,2,16]),
[iquote('hyper,287,2,16')] ).
cnf(301,plain,
theorem(implies(A,not(not(A)))),
inference(para_into,[status(thm),theory(equality)],[296,12]),
[iquote('para_into,296.1.1,11.1.1')] ).
cnf(305,plain,
theorem(not(and(A,not(A)))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[301,2,301]),15]),
[iquote('hyper,301,2,301,demod,15')] ).
cnf(306,plain,
$false,
inference(binary,[status(thm)],[305,3]),
[iquote('binary,305.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL239-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 09:37:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.72/1.92 ----- Otter 3.3f, August 2004 -----
% 1.72/1.92 The process was started by sandbox on n028.cluster.edu,
% 1.72/1.92 Wed Jul 27 09:37:04 2022
% 1.72/1.92 The command was "./otter". The process ID is 3819.
% 1.72/1.92
% 1.72/1.92 set(prolog_style_variables).
% 1.72/1.92 set(auto).
% 1.72/1.92 dependent: set(auto1).
% 1.72/1.92 dependent: set(process_input).
% 1.72/1.92 dependent: clear(print_kept).
% 1.72/1.92 dependent: clear(print_new_demod).
% 1.72/1.92 dependent: clear(print_back_demod).
% 1.72/1.92 dependent: clear(print_back_sub).
% 1.72/1.92 dependent: set(control_memory).
% 1.72/1.92 dependent: assign(max_mem, 12000).
% 1.72/1.92 dependent: assign(pick_given_ratio, 4).
% 1.72/1.92 dependent: assign(stats_level, 1).
% 1.72/1.92 dependent: assign(max_seconds, 10800).
% 1.72/1.92 clear(print_given).
% 1.72/1.92
% 1.72/1.92 list(usable).
% 1.72/1.92 0 [] A=A.
% 1.72/1.92 0 [] axiom(implies(or(A,A),A)).
% 1.72/1.92 0 [] axiom(implies(A,or(B,A))).
% 1.72/1.92 0 [] axiom(implies(or(A,B),or(B,A))).
% 1.72/1.92 0 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.72/1.92 0 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.72/1.92 0 [] implies(X,Y)=or(not(X),Y).
% 1.72/1.92 0 [] theorem(X)| -axiom(X).
% 1.72/1.92 0 [] theorem(X)| -theorem(implies(Y,X))| -theorem(Y).
% 1.72/1.92 0 [] and(P,Q)=not(or(not(P),not(Q))).
% 1.72/1.92 0 [] -theorem(not(and(p,not(p)))).
% 1.72/1.92 end_of_list.
% 1.72/1.92
% 1.72/1.92 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.72/1.92
% 1.72/1.92 This is a Horn set with equality. The strategy will be
% 1.72/1.92 Knuth-Bendix and hyper_res, with positive clauses in
% 1.72/1.92 sos and nonpositive clauses in usable.
% 1.72/1.92
% 1.72/1.92 dependent: set(knuth_bendix).
% 1.72/1.92 dependent: set(anl_eq).
% 1.72/1.92 dependent: set(para_from).
% 1.72/1.92 dependent: set(para_into).
% 1.72/1.92 dependent: clear(para_from_right).
% 1.72/1.92 dependent: clear(para_into_right).
% 1.72/1.92 dependent: set(para_from_vars).
% 1.72/1.92 dependent: set(eq_units_both_ways).
% 1.72/1.92 dependent: set(dynamic_demod_all).
% 1.72/1.92 dependent: set(dynamic_demod).
% 1.72/1.92 dependent: set(order_eq).
% 1.72/1.92 dependent: set(back_demod).
% 1.72/1.92 dependent: set(lrpo).
% 1.72/1.92 dependent: set(hyper_res).
% 1.72/1.92 dependent: clear(order_hyper).
% 1.72/1.92
% 1.72/1.92 ------------> process usable:
% 1.72/1.92 ** KEPT (pick-wt=4): 1 [] theorem(A)| -axiom(A).
% 1.72/1.92 ** KEPT (pick-wt=8): 2 [] theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 1.72/1.92 ** KEPT (pick-wt=6): 3 [] -theorem(not(and(p,not(p)))).
% 1.72/1.92
% 1.72/1.92 ------------> process sos:
% 1.72/1.92 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.72/1.92 ** KEPT (pick-wt=6): 5 [] axiom(implies(or(A,A),A)).
% 1.72/1.92 ** KEPT (pick-wt=6): 6 [] axiom(implies(A,or(B,A))).
% 1.72/1.92 ** KEPT (pick-wt=8): 7 [] axiom(implies(or(A,B),or(B,A))).
% 1.72/1.92 ** KEPT (pick-wt=12): 8 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.72/1.92 ** KEPT (pick-wt=12): 9 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.72/1.92 ** KEPT (pick-wt=8): 11 [copy,10,flip.1] or(not(A),B)=implies(A,B).
% 1.72/1.92 ---> New Demodulator: 12 [new_demod,11] or(not(A),B)=implies(A,B).
% 1.72/1.92 ** KEPT (pick-wt=9): 14 [copy,13,demod,12,flip.1] not(implies(A,not(B)))=and(A,B).
% 1.72/1.92 ---> New Demodulator: 15 [new_demod,14] not(implies(A,not(B)))=and(A,B).
% 1.72/1.92 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.72/1.92 >>>> Starting back demodulation with 12.
% 1.72/1.92 >>>> Starting back demodulation with 15.
% 1.72/1.92
% 1.72/1.92 ======= end of input processing =======
% 1.72/1.92
% 1.72/1.92 =========== start of search ===========
% 1.72/1.92
% 1.72/1.92
% 1.72/1.92 Resetting weight limit to 9.
% 1.72/1.92
% 1.72/1.92
% 1.72/1.92 Resetting weight limit to 9.
% 1.72/1.92
% 1.72/1.92 sos_size=199
% 1.72/1.92
% 1.72/1.92 -------- PROOF --------
% 1.72/1.92
% 1.72/1.92 ----> UNIT CONFLICT at 0.01 sec ----> 306 [binary,305.1,3.1] $F.
% 1.72/1.92
% 1.72/1.92 Length of proof is 18. Level of proof is 13.
% 1.72/1.92
% 1.72/1.92 ---------------- PROOF ----------------
% 1.72/1.92 % SZS status Unsatisfiable
% 1.72/1.92 % SZS output start Refutation
% See solution above
% 1.72/1.92 ------------ end of proof -------------
% 1.72/1.92
% 1.72/1.92
% 1.72/1.92 Search stopped by max_proofs option.
% 1.72/1.92
% 1.72/1.92
% 1.72/1.92 Search stopped by max_proofs option.
% 1.72/1.92
% 1.72/1.92 ============ end of search ============
% 1.72/1.92
% 1.72/1.92 -------------- statistics -------------
% 1.72/1.92 clauses given 85
% 1.72/1.92 clauses generated 1572
% 1.72/1.92 clauses kept 300
% 1.72/1.92 clauses forward subsumed 1071
% 1.72/1.92 clauses back subsumed 6
% 1.72/1.92 Kbytes malloced 4882
% 1.72/1.92
% 1.72/1.92 ----------- times (seconds) -----------
% 1.72/1.92 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.72/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.92 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.92
% 1.72/1.92 That finishes the proof of the theorem.
% 1.72/1.92
% 1.72/1.92 Process 3819 finished Wed Jul 27 09:37:05 2022
% 1.72/1.92 Otter interrupted
% 1.72/1.92 PROOF FOUND
%------------------------------------------------------------------------------