TSTP Solution File: LCL189-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL189-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:03:50 EDT 2022
% Result : Unsatisfiable 2.01s 2.18s
% Output : Refutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 28 unt; 0 nHn; 5 RR)
% Number of literals : 33 ( 2 equ; 5 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; 2 con; 0-2 aty)
% Number of variables : 56 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( theorem(A)
| ~ axiom(A) ),
file('LCL189-3.p',unknown),
[] ).
cnf(2,axiom,
( theorem(A)
| ~ theorem(implies(B,A))
| ~ theorem(B) ),
file('LCL189-3.p',unknown),
[] ).
cnf(3,axiom,
~ theorem(or(not(p),implies(implies(p,q),q))),
file('LCL189-3.p',unknown),
[] ).
cnf(5,axiom,
axiom(implies(or(A,A),A)),
file('LCL189-3.p',unknown),
[] ).
cnf(6,axiom,
axiom(implies(A,or(B,A))),
file('LCL189-3.p',unknown),
[] ).
cnf(7,axiom,
axiom(implies(or(A,B),or(B,A))),
file('LCL189-3.p',unknown),
[] ).
cnf(8,axiom,
axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('LCL189-3.p',unknown),
[] ).
cnf(10,axiom,
implies(A,B) = or(not(A),B),
file('LCL189-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,plain,
~ theorem(implies(p,implies(implies(p,q),q))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),12]),
[iquote('back_demod,3,demod,12')] ).
cnf(14,plain,
theorem(implies(or(A,A),A)),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(15,plain,
theorem(implies(A,or(B,A))),
inference(hyper,[status(thm)],[6,1]),
[iquote('hyper,6,1')] ).
cnf(18,plain,
theorem(implies(or(A,B),or(B,A))),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(29,plain,
theorem(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(hyper,[status(thm)],[8,1]),
[iquote('hyper,8,1')] ).
cnf(41,plain,
theorem(implies(implies(A,B),or(B,not(A)))),
inference(para_into,[status(thm),theory(equality)],[18,12]),
[iquote('para_into,18.1.1.1,11.1.1')] ).
cnf(42,plain,
theorem(implies(or(A,not(B)),implies(B,A))),
inference(para_into,[status(thm),theory(equality)],[18,12]),
[iquote('para_into,18.1.1.2,11.1.1')] ).
cnf(69,plain,
theorem(or(or(A,B),not(B))),
inference(hyper,[status(thm)],[41,2,15]),
[iquote('hyper,41,2,15')] ).
cnf(75,plain,
theorem(or(A,or(or(B,C),not(C)))),
inference(hyper,[status(thm)],[69,2,15]),
[iquote('hyper,69,2,15')] ).
cnf(82,plain,
theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,12]),12]),
[iquote('para_into,29.1.1.1,11.1.1,demod,12')] ).
cnf(127,plain,
theorem(or(or(A,B),or(C,not(B)))),
inference(hyper,[status(thm)],[75,2,29]),
[iquote('hyper,75,2,29')] ).
cnf(150,plain,
theorem(or(or(A,not(B)),or(C,B))),
inference(hyper,[status(thm)],[127,2,18]),
[iquote('hyper,127,2,18')] ).
cnf(182,plain,
theorem(or(A,or(or(B,not(C)),C))),
inference(hyper,[status(thm)],[150,2,29]),
[iquote('hyper,150,2,29')] ).
cnf(211,plain,
theorem(or(or(A,not(B)),B)),
inference(hyper,[status(thm)],[182,2,14]),
[iquote('hyper,182,2,14')] ).
cnf(217,plain,
theorem(or(A,or(B,not(A)))),
inference(hyper,[status(thm)],[211,2,18]),
[iquote('hyper,211,2,18')] ).
cnf(225,plain,
theorem(or(A,or(B,not(B)))),
inference(hyper,[status(thm)],[217,2,29]),
[iquote('hyper,217,2,29')] ).
cnf(237,plain,
theorem(or(A,not(A))),
inference(hyper,[status(thm)],[225,2,14]),
[iquote('hyper,225,2,14')] ).
cnf(241,plain,
theorem(implies(A,A)),
inference(hyper,[status(thm)],[237,2,42]),
[iquote('hyper,237,2,42')] ).
cnf(329,plain,
theorem(or(A,implies(or(A,B),B))),
inference(hyper,[status(thm)],[82,2,241]),
[iquote('hyper,82,2,241')] ).
cnf(332,plain,
theorem(implies(A,implies(implies(A,B),B))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[329,12]),12]),
[iquote('para_into,329.1.1.2.1,11.1.1,demod,12')] ).
cnf(333,plain,
$false,
inference(binary,[status(thm)],[332,13]),
[iquote('binary,332.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL189-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n006.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:21:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.01/2.18 ----- Otter 3.3f, August 2004 -----
% 2.01/2.18 The process was started by sandbox on n006.cluster.edu,
% 2.01/2.18 Wed Jul 27 09:21:47 2022
% 2.01/2.18 The command was "./otter". The process ID is 10776.
% 2.01/2.18
% 2.01/2.18 set(prolog_style_variables).
% 2.01/2.18 set(auto).
% 2.01/2.18 dependent: set(auto1).
% 2.01/2.18 dependent: set(process_input).
% 2.01/2.18 dependent: clear(print_kept).
% 2.01/2.18 dependent: clear(print_new_demod).
% 2.01/2.18 dependent: clear(print_back_demod).
% 2.01/2.18 dependent: clear(print_back_sub).
% 2.01/2.18 dependent: set(control_memory).
% 2.01/2.18 dependent: assign(max_mem, 12000).
% 2.01/2.18 dependent: assign(pick_given_ratio, 4).
% 2.01/2.18 dependent: assign(stats_level, 1).
% 2.01/2.18 dependent: assign(max_seconds, 10800).
% 2.01/2.18 clear(print_given).
% 2.01/2.18
% 2.01/2.18 list(usable).
% 2.01/2.18 0 [] A=A.
% 2.01/2.18 0 [] axiom(implies(or(A,A),A)).
% 2.01/2.18 0 [] axiom(implies(A,or(B,A))).
% 2.01/2.18 0 [] axiom(implies(or(A,B),or(B,A))).
% 2.01/2.18 0 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 2.01/2.18 0 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.01/2.18 0 [] implies(X,Y)=or(not(X),Y).
% 2.01/2.18 0 [] theorem(X)| -axiom(X).
% 2.01/2.18 0 [] theorem(X)| -theorem(implies(Y,X))| -theorem(Y).
% 2.01/2.18 0 [] -theorem(or(not(p),implies(implies(p,q),q))).
% 2.01/2.18 end_of_list.
% 2.01/2.18
% 2.01/2.18 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 2.01/2.18
% 2.01/2.18 This is a Horn set with equality. The strategy will be
% 2.01/2.18 Knuth-Bendix and hyper_res, with positive clauses in
% 2.01/2.18 sos and nonpositive clauses in usable.
% 2.01/2.18
% 2.01/2.18 dependent: set(knuth_bendix).
% 2.01/2.18 dependent: set(anl_eq).
% 2.01/2.18 dependent: set(para_from).
% 2.01/2.18 dependent: set(para_into).
% 2.01/2.18 dependent: clear(para_from_right).
% 2.01/2.18 dependent: clear(para_into_right).
% 2.01/2.18 dependent: set(para_from_vars).
% 2.01/2.18 dependent: set(eq_units_both_ways).
% 2.01/2.18 dependent: set(dynamic_demod_all).
% 2.01/2.18 dependent: set(dynamic_demod).
% 2.01/2.18 dependent: set(order_eq).
% 2.01/2.18 dependent: set(back_demod).
% 2.01/2.18 dependent: set(lrpo).
% 2.01/2.18 dependent: set(hyper_res).
% 2.01/2.18 dependent: clear(order_hyper).
% 2.01/2.18
% 2.01/2.18 ------------> process usable:
% 2.01/2.18 ** KEPT (pick-wt=4): 1 [] theorem(A)| -axiom(A).
% 2.01/2.18 ** KEPT (pick-wt=8): 2 [] theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 2.01/2.18 ** KEPT (pick-wt=9): 3 [] -theorem(or(not(p),implies(implies(p,q),q))).
% 2.01/2.18
% 2.01/2.18 ------------> process sos:
% 2.01/2.18 ** KEPT (pick-wt=3): 4 [] A=A.
% 2.01/2.18 ** KEPT (pick-wt=6): 5 [] axiom(implies(or(A,A),A)).
% 2.01/2.18 ** KEPT (pick-wt=6): 6 [] axiom(implies(A,or(B,A))).
% 2.01/2.18 ** KEPT (pick-wt=8): 7 [] axiom(implies(or(A,B),or(B,A))).
% 2.01/2.18 ** KEPT (pick-wt=12): 8 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 2.01/2.18 ** KEPT (pick-wt=12): 9 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.01/2.18 ** KEPT (pick-wt=8): 11 [copy,10,flip.1] or(not(A),B)=implies(A,B).
% 2.01/2.18 ---> New Demodulator: 12 [new_demod,11] or(not(A),B)=implies(A,B).
% 2.01/2.18 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 2.01/2.18 >>>> Starting back demodulation with 12.
% 2.01/2.18 >> back demodulating 3 with 12.
% 2.01/2.18
% 2.01/2.18 ======= end of input processing =======
% 2.01/2.18
% 2.01/2.18 =========== start of search ===========
% 2.01/2.18
% 2.01/2.18
% 2.01/2.18 Resetting weight limit to 8.
% 2.01/2.18
% 2.01/2.18
% 2.01/2.18 Resetting weight limit to 8.
% 2.01/2.18
% 2.01/2.18 sos_size=223
% 2.01/2.18
% 2.01/2.18 -------- PROOF --------
% 2.01/2.18
% 2.01/2.18 ----> UNIT CONFLICT at 0.04 sec ----> 333 [binary,332.1,13.1] $F.
% 2.01/2.18
% 2.01/2.18 Length of proof is 21. Level of proof is 14.
% 2.01/2.18
% 2.01/2.18 ---------------- PROOF ----------------
% 2.01/2.18 % SZS status Unsatisfiable
% 2.01/2.18 % SZS output start Refutation
% See solution above
% 2.01/2.18 ------------ end of proof -------------
% 2.01/2.18
% 2.01/2.18
% 2.01/2.18 Search stopped by max_proofs option.
% 2.01/2.18
% 2.01/2.18
% 2.01/2.18 Search stopped by max_proofs option.
% 2.01/2.18
% 2.01/2.18 ============ end of search ============
% 2.01/2.18
% 2.01/2.18 -------------- statistics -------------
% 2.01/2.18 clauses given 174
% 2.01/2.18 clauses generated 7690
% 2.01/2.18 clauses kept 330
% 2.01/2.18 clauses forward subsumed 4977
% 2.01/2.18 clauses back subsumed 7
% 2.01/2.18 Kbytes malloced 5859
% 2.01/2.18
% 2.01/2.18 ----------- times (seconds) -----------
% 2.01/2.18 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 2.01/2.18 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.01/2.18 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.01/2.18
% 2.01/2.18 That finishes the proof of the theorem.
% 2.01/2.18
% 2.01/2.18 Process 10776 finished Wed Jul 27 09:21:48 2022
% 2.01/2.18 Otter interrupted
% 2.01/2.18 PROOF FOUND
%------------------------------------------------------------------------------