TSTP Solution File: LCL186-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL186-1 : TPTP v8.1.0. Released v1.1.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:03:49 EDT 2022
% Result : Unsatisfiable 1.76s 1.93s
% Output : Refutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 4 RR)
% Number of literals : 14 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( theorem(A)
| ~ axiom(A) ),
file('LCL186-1.p',unknown),
[] ).
cnf(3,axiom,
( theorem(or(not(A),B))
| ~ axiom(or(not(A),C))
| ~ theorem(or(not(C),B)) ),
file('LCL186-1.p',unknown),
[] ).
cnf(4,axiom,
~ theorem(or(not(not(p)),or(not(p),q))),
file('LCL186-1.p',unknown),
[] ).
cnf(5,axiom,
axiom(or(not(or(A,A)),A)),
file('LCL186-1.p',unknown),
[] ).
cnf(6,axiom,
axiom(or(not(A),or(B,A))),
file('LCL186-1.p',unknown),
[] ).
cnf(7,axiom,
axiom(or(not(or(A,B)),or(B,A))),
file('LCL186-1.p',unknown),
[] ).
cnf(10,plain,
theorem(or(not(or(A,A)),A)),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(12,plain,
theorem(or(not(A),A)),
inference(hyper,[status(thm)],[10,3,6]),
[iquote('hyper,10,3,6')] ).
cnf(19,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(hyper,[status(thm)],[7,3,12]),
[iquote('hyper,7,3,12')] ).
cnf(92,plain,
theorem(or(not(A),or(A,B))),
inference(hyper,[status(thm)],[19,3,6]),
[iquote('hyper,19,3,6')] ).
cnf(93,plain,
$false,
inference(binary,[status(thm)],[92,4]),
[iquote('binary,92.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL186-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n028.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:28:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.76/1.93 ----- Otter 3.3f, August 2004 -----
% 1.76/1.93 The process was started by sandbox on n028.cluster.edu,
% 1.76/1.93 Wed Jul 27 09:28:49 2022
% 1.76/1.93 The command was "./otter". The process ID is 12526.
% 1.76/1.93
% 1.76/1.93 set(prolog_style_variables).
% 1.76/1.93 set(auto).
% 1.76/1.93 dependent: set(auto1).
% 1.76/1.93 dependent: set(process_input).
% 1.76/1.93 dependent: clear(print_kept).
% 1.76/1.93 dependent: clear(print_new_demod).
% 1.76/1.93 dependent: clear(print_back_demod).
% 1.76/1.93 dependent: clear(print_back_sub).
% 1.76/1.93 dependent: set(control_memory).
% 1.76/1.93 dependent: assign(max_mem, 12000).
% 1.76/1.93 dependent: assign(pick_given_ratio, 4).
% 1.76/1.93 dependent: assign(stats_level, 1).
% 1.76/1.93 dependent: assign(max_seconds, 10800).
% 1.76/1.93 clear(print_given).
% 1.76/1.93
% 1.76/1.93 list(usable).
% 1.76/1.93 0 [] axiom(or(not(or(A,A)),A)).
% 1.76/1.93 0 [] axiom(or(not(A),or(B,A))).
% 1.76/1.93 0 [] axiom(or(not(or(A,B)),or(B,A))).
% 1.76/1.93 0 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.76/1.93 0 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.76/1.93 0 [] theorem(X)| -axiom(X).
% 1.76/1.93 0 [] theorem(X)| -axiom(or(not(Y),X))| -theorem(Y).
% 1.76/1.93 0 [] theorem(or(not(X),Z))| -axiom(or(not(X),Y))| -theorem(or(not(Y),Z)).
% 1.76/1.93 0 [] -theorem(or(not(not(p)),or(not(p),q))).
% 1.76/1.93 end_of_list.
% 1.76/1.93
% 1.76/1.93 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.76/1.93
% 1.76/1.93 This is a Horn set without equality. The strategy will
% 1.76/1.93 be hyperresolution, with satellites in sos and nuclei
% 1.76/1.93 in usable.
% 1.76/1.93
% 1.76/1.93 dependent: set(hyper_res).
% 1.76/1.93 dependent: clear(order_hyper).
% 1.76/1.93
% 1.76/1.93 ------------> process usable:
% 1.76/1.93 ** KEPT (pick-wt=4): 1 [] theorem(A)| -axiom(A).
% 1.76/1.93 ** KEPT (pick-wt=9): 2 [] theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 1.76/1.93 ** KEPT (pick-wt=15): 3 [] theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 1.76/1.93 ** KEPT (pick-wt=9): 4 [] -theorem(or(not(not(p)),or(not(p),q))).
% 1.76/1.93
% 1.76/1.93 ------------> process sos:
% 1.76/1.93 ** KEPT (pick-wt=7): 5 [] axiom(or(not(or(A,A)),A)).
% 1.76/1.93 ** KEPT (pick-wt=7): 6 [] axiom(or(not(A),or(B,A))).
% 1.76/1.93 ** KEPT (pick-wt=9): 7 [] axiom(or(not(or(A,B)),or(B,A))).
% 1.76/1.93 ** KEPT (pick-wt=13): 8 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.76/1.93 ** KEPT (pick-wt=15): 9 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.76/1.93
% 1.76/1.93 ======= end of input processing =======
% 1.76/1.93
% 1.76/1.93 =========== start of search ===========
% 1.76/1.93
% 1.76/1.93 -------- PROOF --------
% 1.76/1.93
% 1.76/1.93 ----> UNIT CONFLICT at 0.00 sec ----> 93 [binary,92.1,4.1] $F.
% 1.76/1.93
% 1.76/1.93 Length of proof is 4. Level of proof is 4.
% 1.76/1.93
% 1.76/1.93 ---------------- PROOF ----------------
% 1.76/1.93 % SZS status Unsatisfiable
% 1.76/1.93 % SZS output start Refutation
% See solution above
% 1.76/1.93 ------------ end of proof -------------
% 1.76/1.93
% 1.76/1.93
% 1.76/1.93 Search stopped by max_proofs option.
% 1.76/1.93
% 1.76/1.93
% 1.76/1.93 Search stopped by max_proofs option.
% 1.76/1.93
% 1.76/1.93 ============ end of search ============
% 1.76/1.93
% 1.76/1.93 -------------- statistics -------------
% 1.76/1.93 clauses given 23
% 1.76/1.93 clauses generated 138
% 1.76/1.93 clauses kept 92
% 1.76/1.93 clauses forward subsumed 55
% 1.76/1.93 clauses back subsumed 2
% 1.76/1.93 Kbytes malloced 976
% 1.76/1.93
% 1.76/1.93 ----------- times (seconds) -----------
% 1.76/1.93 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.93 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.76/1.93
% 1.76/1.93 That finishes the proof of the theorem.
% 1.76/1.93
% 1.76/1.93 Process 12526 finished Wed Jul 27 09:28:50 2022
% 1.76/1.93 Otter interrupted
% 1.76/1.93 PROOF FOUND
%------------------------------------------------------------------------------