TSTP Solution File: LCL169-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL169-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:03:44 EDT 2022
% Result : Unsatisfiable 1.78s 1.93s
% Output : Refutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 7 unt; 0 nHn; 3 RR)
% Number of literals : 9 ( 2 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( theorem(A)
| ~ axiom(A) ),
file('LCL169-3.p',unknown),
[] ).
cnf(3,axiom,
~ theorem(implies(implies(p,not(p)),not(p))),
file('LCL169-3.p',unknown),
[] ).
cnf(5,axiom,
axiom(implies(or(A,A),A)),
file('LCL169-3.p',unknown),
[] ).
cnf(10,axiom,
implies(A,B) = or(not(A),B),
file('LCL169-3.p',unknown),
[] ).
cnf(11,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(or(A,A),A)),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(22,plain,
theorem(implies(implies(A,not(A)),not(A))),
inference(para_from,[status(thm),theory(equality)],[11,13]),
[iquote('para_from,11.1.1,13.1.1.1')] ).
cnf(23,plain,
$false,
inference(binary,[status(thm)],[22,3]),
[iquote('binary,22.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/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:09:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.78/1.93 ----- Otter 3.3f, August 2004 -----
% 1.78/1.93 The process was started by sandbox on n007.cluster.edu,
% 1.78/1.93 Wed Jul 27 09:09:16 2022
% 1.78/1.93 The command was "./otter". The process ID is 31373.
% 1.78/1.93
% 1.78/1.93 set(prolog_style_variables).
% 1.78/1.93 set(auto).
% 1.78/1.93 dependent: set(auto1).
% 1.78/1.93 dependent: set(process_input).
% 1.78/1.93 dependent: clear(print_kept).
% 1.78/1.93 dependent: clear(print_new_demod).
% 1.78/1.93 dependent: clear(print_back_demod).
% 1.78/1.93 dependent: clear(print_back_sub).
% 1.78/1.93 dependent: set(control_memory).
% 1.78/1.93 dependent: assign(max_mem, 12000).
% 1.78/1.93 dependent: assign(pick_given_ratio, 4).
% 1.78/1.93 dependent: assign(stats_level, 1).
% 1.78/1.93 dependent: assign(max_seconds, 10800).
% 1.78/1.93 clear(print_given).
% 1.78/1.93
% 1.78/1.93 list(usable).
% 1.78/1.93 0 [] A=A.
% 1.78/1.93 0 [] axiom(implies(or(A,A),A)).
% 1.78/1.93 0 [] axiom(implies(A,or(B,A))).
% 1.78/1.93 0 [] axiom(implies(or(A,B),or(B,A))).
% 1.78/1.93 0 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.78/1.93 0 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.78/1.93 0 [] implies(X,Y)=or(not(X),Y).
% 1.78/1.93 0 [] theorem(X)| -axiom(X).
% 1.78/1.93 0 [] theorem(X)| -theorem(implies(Y,X))| -theorem(Y).
% 1.78/1.93 0 [] -theorem(implies(implies(p,not(p)),not(p))).
% 1.78/1.93 end_of_list.
% 1.78/1.93
% 1.78/1.93 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.78/1.93
% 1.78/1.93 This is a Horn set with equality. The strategy will be
% 1.78/1.93 Knuth-Bendix and hyper_res, with positive clauses in
% 1.78/1.93 sos and nonpositive clauses in usable.
% 1.78/1.93
% 1.78/1.93 dependent: set(knuth_bendix).
% 1.78/1.93 dependent: set(anl_eq).
% 1.78/1.93 dependent: set(para_from).
% 1.78/1.93 dependent: set(para_into).
% 1.78/1.93 dependent: clear(para_from_right).
% 1.78/1.93 dependent: clear(para_into_right).
% 1.78/1.93 dependent: set(para_from_vars).
% 1.78/1.93 dependent: set(eq_units_both_ways).
% 1.78/1.93 dependent: set(dynamic_demod_all).
% 1.78/1.93 dependent: set(dynamic_demod).
% 1.78/1.93 dependent: set(order_eq).
% 1.78/1.93 dependent: set(back_demod).
% 1.78/1.93 dependent: set(lrpo).
% 1.78/1.93 dependent: set(hyper_res).
% 1.78/1.93 dependent: clear(order_hyper).
% 1.78/1.93
% 1.78/1.93 ------------> process usable:
% 1.78/1.93 ** KEPT (pick-wt=4): 1 [] theorem(A)| -axiom(A).
% 1.78/1.93 ** KEPT (pick-wt=8): 2 [] theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 1.78/1.93 ** KEPT (pick-wt=8): 3 [] -theorem(implies(implies(p,not(p)),not(p))).
% 1.78/1.93
% 1.78/1.93 ------------> process sos:
% 1.78/1.93 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.78/1.93 ** KEPT (pick-wt=6): 5 [] axiom(implies(or(A,A),A)).
% 1.78/1.93 ** KEPT (pick-wt=6): 6 [] axiom(implies(A,or(B,A))).
% 1.78/1.93 ** KEPT (pick-wt=8): 7 [] axiom(implies(or(A,B),or(B,A))).
% 1.78/1.93 ** KEPT (pick-wt=12): 8 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.78/1.93 ** KEPT (pick-wt=12): 9 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.78/1.93 ** KEPT (pick-wt=8): 11 [copy,10,flip.1] or(not(A),B)=implies(A,B).
% 1.78/1.93 ---> New Demodulator: 12 [new_demod,11] or(not(A),B)=implies(A,B).
% 1.78/1.93 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.78/1.93 >>>> Starting back demodulation with 12.
% 1.78/1.93
% 1.78/1.93 ======= end of input processing =======
% 1.78/1.93
% 1.78/1.93 =========== start of search ===========
% 1.78/1.93
% 1.78/1.93 -------- PROOF --------
% 1.78/1.93
% 1.78/1.93 ----> UNIT CONFLICT at 0.00 sec ----> 23 [binary,22.1,3.1] $F.
% 1.78/1.93
% 1.78/1.93 Length of proof is 3. Level of proof is 2.
% 1.78/1.93
% 1.78/1.93 ---------------- PROOF ----------------
% 1.78/1.93 % SZS status Unsatisfiable
% 1.78/1.93 % SZS output start Refutation
% See solution above
% 1.78/1.93 ------------ end of proof -------------
% 1.78/1.93
% 1.78/1.93
% 1.78/1.93 Search stopped by max_proofs option.
% 1.78/1.93
% 1.78/1.93
% 1.78/1.93 Search stopped by max_proofs option.
% 1.78/1.93
% 1.78/1.93 ============ end of search ============
% 1.78/1.93
% 1.78/1.93 -------------- statistics -------------
% 1.78/1.93 clauses given 7
% 1.78/1.93 clauses generated 13
% 1.78/1.93 clauses kept 20
% 1.78/1.93 clauses forward subsumed 4
% 1.78/1.93 clauses back subsumed 0
% 1.78/1.93 Kbytes malloced 976
% 1.78/1.93
% 1.78/1.93 ----------- times (seconds) -----------
% 1.78/1.93 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/1.93 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.78/1.93
% 1.78/1.93 That finishes the proof of the theorem.
% 1.78/1.93
% 1.78/1.93 Process 31373 finished Wed Jul 27 09:09:17 2022
% 1.78/1.93 Otter interrupted
% 1.78/1.93 PROOF FOUND
%------------------------------------------------------------------------------