TSTP Solution File: LCL186-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:49 EDT 2022
% Result : Unsatisfiable 1.95s 2.15s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 2 RR)
% Number of literals : 10 ( 9 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 18 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
theorem(or(not(not(p)),or(not(p),q))) != true,
file('LCL186-10.p',unknown),
[] ).
cnf(4,axiom,
ife_q(A,A,B,C) = B,
file('LCL186-10.p',unknown),
[] ).
cnf(7,axiom,
axiom(or(not(A),or(B,A))) = true,
file('LCL186-10.p',unknown),
[] ).
cnf(9,axiom,
axiom(or(not(or(A,B)),or(B,A))) = true,
file('LCL186-10.p',unknown),
[] ).
cnf(15,axiom,
ife_q(axiom(A),true,theorem(A),true) = true,
file('LCL186-10.p',unknown),
[] ).
cnf(19,axiom,
ife_q(theorem(or(not(A),B)),true,ife_q(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true) = true,
file('LCL186-10.p',unknown),
[] ).
cnf(25,plain,
theorem(or(not(or(A,B)),or(B,A))) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[9,15]),4]),
[iquote('para_from,9.1.1,15.1.1.1,demod,4')] ).
cnf(73,plain,
ife_q(axiom(or(not(A),or(B,C))),true,theorem(or(not(A),or(C,B))),true) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,25]),4]),
[iquote('para_into,19.1.1.1,25.1.1,demod,4')] ).
cnf(469,plain,
theorem(or(not(A),or(A,B))) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[73,7]),4]),
[iquote('para_into,73.1.1.1,7.1.1,demod,4')] ).
cnf(471,plain,
$false,
inference(binary,[status(thm)],[469,1]),
[iquote('binary,469.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL186-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 09:22:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.95/2.15 ----- Otter 3.3f, August 2004 -----
% 1.95/2.15 The process was started by sandbox2 on n011.cluster.edu,
% 1.95/2.15 Wed Jul 27 09:22:25 2022
% 1.95/2.15 The command was "./otter". The process ID is 4676.
% 1.95/2.15
% 1.95/2.15 set(prolog_style_variables).
% 1.95/2.15 set(auto).
% 1.95/2.15 dependent: set(auto1).
% 1.95/2.15 dependent: set(process_input).
% 1.95/2.15 dependent: clear(print_kept).
% 1.95/2.15 dependent: clear(print_new_demod).
% 1.95/2.15 dependent: clear(print_back_demod).
% 1.95/2.15 dependent: clear(print_back_sub).
% 1.95/2.15 dependent: set(control_memory).
% 1.95/2.15 dependent: assign(max_mem, 12000).
% 1.95/2.15 dependent: assign(pick_given_ratio, 4).
% 1.95/2.15 dependent: assign(stats_level, 1).
% 1.95/2.15 dependent: assign(max_seconds, 10800).
% 1.95/2.15 clear(print_given).
% 1.95/2.15
% 1.95/2.15 list(usable).
% 1.95/2.15 0 [] A=A.
% 1.95/2.15 0 [] ife_q(A,A,B,C)=B.
% 1.95/2.15 0 [] axiom(or(not(or(A,A)),A))=true.
% 1.95/2.15 0 [] axiom(or(not(A),or(B,A)))=true.
% 1.95/2.15 0 [] axiom(or(not(or(A,B)),or(B,A)))=true.
% 1.95/2.15 0 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))=true.
% 1.95/2.15 0 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))=true.
% 1.95/2.15 0 [] ife_q(axiom(X),true,theorem(X),true)=true.
% 1.95/2.15 0 [] ife_q(theorem(Y),true,ife_q(axiom(or(not(Y),X)),true,theorem(X),true),true)=true.
% 1.95/2.15 0 [] ife_q(theorem(or(not(Y),Z)),true,ife_q(axiom(or(not(X),Y)),true,theorem(or(not(X),Z)),true),true)=true.
% 1.95/2.15 0 [] theorem(or(not(not(p)),or(not(p),q)))!=true.
% 1.95/2.15 end_of_list.
% 1.95/2.15
% 1.95/2.15 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.95/2.15
% 1.95/2.15 All clauses are units, and equality is present; the
% 1.95/2.15 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.95/2.15
% 1.95/2.15 dependent: set(knuth_bendix).
% 1.95/2.15 dependent: set(anl_eq).
% 1.95/2.15 dependent: set(para_from).
% 1.95/2.15 dependent: set(para_into).
% 1.95/2.15 dependent: clear(para_from_right).
% 1.95/2.15 dependent: clear(para_into_right).
% 1.95/2.15 dependent: set(para_from_vars).
% 1.95/2.15 dependent: set(eq_units_both_ways).
% 1.95/2.15 dependent: set(dynamic_demod_all).
% 1.95/2.15 dependent: set(dynamic_demod).
% 1.95/2.15 dependent: set(order_eq).
% 1.95/2.15 dependent: set(back_demod).
% 1.95/2.15 dependent: set(lrpo).
% 1.95/2.15
% 1.95/2.15 ------------> process usable:
% 1.95/2.15 ** KEPT (pick-wt=11): 1 [] theorem(or(not(not(p)),or(not(p),q)))!=true.
% 1.95/2.15
% 1.95/2.15 ------------> process sos:
% 1.95/2.15 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.95/2.15 ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 1.95/2.15 ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 1.95/2.15 ** KEPT (pick-wt=9): 5 [] axiom(or(not(or(A,A)),A))=true.
% 1.95/2.15 ---> New Demodulator: 6 [new_demod,5] axiom(or(not(or(A,A)),A))=true.
% 1.95/2.15 ** KEPT (pick-wt=9): 7 [] axiom(or(not(A),or(B,A)))=true.
% 1.95/2.15 ---> New Demodulator: 8 [new_demod,7] axiom(or(not(A),or(B,A)))=true.
% 1.95/2.15 ** KEPT (pick-wt=11): 9 [] axiom(or(not(or(A,B)),or(B,A)))=true.
% 1.95/2.15 ---> New Demodulator: 10 [new_demod,9] axiom(or(not(or(A,B)),or(B,A)))=true.
% 1.95/2.15 ** KEPT (pick-wt=15): 11 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))=true.
% 1.95/2.15 ---> New Demodulator: 12 [new_demod,11] axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))=true.
% 1.95/2.15 ** KEPT (pick-wt=17): 13 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))=true.
% 1.95/2.15 ---> New Demodulator: 14 [new_demod,13] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))=true.
% 1.95/2.15 ** KEPT (pick-wt=9): 15 [] ife_q(axiom(A),true,theorem(A),true)=true.
% 1.95/2.15 ---> New Demodulator: 16 [new_demod,15] ife_q(axiom(A),true,theorem(A),true)=true.
% 1.95/2.15 ** KEPT (pick-wt=17): 17 [] ife_q(theorem(A),true,ife_q(axiom(or(not(A),B)),true,theorem(B),true),true)=true.
% 1.95/2.15 ---> New Demodulator: 18 [new_demod,17] ife_q(theorem(A),true,ife_q(axiom(or(not(A),B)),true,theorem(B),true),true)=true.
% 1.95/2.15 ** KEPT (pick-wt=23): 19 [] ife_q(theorem(or(not(A),B)),true,ife_q(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true)=true.
% 1.95/2.15 ---> New Demodulator: 20 [new_demod,19] ife_q(theorem(or(not(A),B)),true,ife_q(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true)=true.
% 1.95/2.15 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.95/2.15 >>>> Starting back demodulation with 4.
% 1.95/2.15 >>>> Starting back demodulation with 6.
% 1.95/2.15 >>>> Starting back demodulation with 8.
% 1.95/2.15 >>>> Starting back demodulation with 10.
% 1.95/2.15 >>>> Starting back demodulation with 12.
% 1.95/2.15 >>>> Starting back demodulation with 14.
% 1.95/2.15 >>>> Starting back demodulation with 16.
% 1.95/2.15 >>>> Starting back demodulation with 18.
% 1.95/2.15 >>>> Starting back demodulation with 20.
% 1.95/2.15
% 1.95/2.15 ======= end of input processing =======
% 1.95/2.15
% 1.95/2.15 =========== start of search ===========
% 1.95/2.15
% 1.95/2.15 -------- PROOF --------
% 1.95/2.15
% 1.95/2.15 ----> UNIT CONFLICT at 0.02 sec ----> 471 [binary,469.1,1.1] $F.
% 1.95/2.15
% 1.95/2.15 Length of proof is 3. Level of proof is 3.
% 1.95/2.15
% 1.95/2.15 ---------------- PROOF ----------------
% 1.95/2.15 % SZS status Unsatisfiable
% 1.95/2.15 % SZS output start Refutation
% See solution above
% 1.95/2.15 ------------ end of proof -------------
% 1.95/2.15
% 1.95/2.15
% 1.95/2.15 Search stopped by max_proofs option.
% 1.95/2.15
% 1.95/2.15
% 1.95/2.15 Search stopped by max_proofs option.
% 1.95/2.15
% 1.95/2.15 ============ end of search ============
% 1.95/2.15
% 1.95/2.15 -------------- statistics -------------
% 1.95/2.15 clauses given 66
% 1.95/2.15 clauses generated 1772
% 1.95/2.15 clauses kept 236
% 1.95/2.15 clauses forward subsumed 1565
% 1.95/2.15 clauses back subsumed 0
% 1.95/2.15 Kbytes malloced 3906
% 1.95/2.15
% 1.95/2.15 ----------- times (seconds) -----------
% 1.95/2.15 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.95/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.15
% 1.95/2.15 That finishes the proof of the theorem.
% 1.95/2.15
% 1.95/2.15 Process 4676 finished Wed Jul 27 09:22:27 2022
% 1.95/2.15 Otter interrupted
% 1.95/2.15 PROOF FOUND
%------------------------------------------------------------------------------