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