TSTP Solution File: LCL204-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL204-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:53 EDT 2022
% Result : Unsatisfiable 1.72s 1.98s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 14 unt; 0 nHn; 5 RR)
% Number of literals : 22 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 31 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( theorem(A)
| ~ axiom(A) ),
file('LCL204-1.p',unknown),
[] ).
cnf(2,axiom,
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
file('LCL204-1.p',unknown),
[] ).
cnf(3,axiom,
( theorem(or(not(A),B))
| ~ axiom(or(not(A),C))
| ~ theorem(or(not(C),B)) ),
file('LCL204-1.p',unknown),
[] ).
cnf(4,axiom,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))),
file('LCL204-1.p',unknown),
[] ).
cnf(5,axiom,
axiom(or(not(or(A,A)),A)),
file('LCL204-1.p',unknown),
[] ).
cnf(6,axiom,
axiom(or(not(A),or(B,A))),
file('LCL204-1.p',unknown),
[] ).
cnf(7,axiom,
axiom(or(not(or(A,B)),or(B,A))),
file('LCL204-1.p',unknown),
[] ).
cnf(8,axiom,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file('LCL204-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(104,plain,
theorem(or(A,or(not(A),B))),
inference(hyper,[status(thm)],[92,2,8]),
[iquote('hyper,92,2,8')] ).
cnf(109,plain,
theorem(or(not(or(A,B)),or(not(not(or(B,A))),C))),
inference(hyper,[status(thm)],[104,3,7]),
[iquote('hyper,104,3,7')] ).
cnf(1043,plain,
theorem(or(not(A),or(not(not(or(A,B))),C))),
inference(hyper,[status(thm)],[109,3,6]),
[iquote('hyper,109,3,6')] ).
cnf(1648,plain,
theorem(or(not(not(or(A,B))),or(not(A),C))),
inference(hyper,[status(thm)],[1043,2,8]),
[iquote('hyper,1043,2,8')] ).
cnf(1649,plain,
$false,
inference(binary,[status(thm)],[1648,4]),
[iquote('binary,1648.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL204-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 09:11:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.72/1.98 ----- Otter 3.3f, August 2004 -----
% 1.72/1.98 The process was started by sandbox on n021.cluster.edu,
% 1.72/1.98 Wed Jul 27 09:11:53 2022
% 1.72/1.98 The command was "./otter". The process ID is 10776.
% 1.72/1.98
% 1.72/1.98 set(prolog_style_variables).
% 1.72/1.98 set(auto).
% 1.72/1.98 dependent: set(auto1).
% 1.72/1.98 dependent: set(process_input).
% 1.72/1.98 dependent: clear(print_kept).
% 1.72/1.98 dependent: clear(print_new_demod).
% 1.72/1.98 dependent: clear(print_back_demod).
% 1.72/1.98 dependent: clear(print_back_sub).
% 1.72/1.98 dependent: set(control_memory).
% 1.72/1.98 dependent: assign(max_mem, 12000).
% 1.72/1.98 dependent: assign(pick_given_ratio, 4).
% 1.72/1.98 dependent: assign(stats_level, 1).
% 1.72/1.98 dependent: assign(max_seconds, 10800).
% 1.72/1.98 clear(print_given).
% 1.72/1.98
% 1.72/1.98 list(usable).
% 1.72/1.98 0 [] axiom(or(not(or(A,A)),A)).
% 1.72/1.98 0 [] axiom(or(not(A),or(B,A))).
% 1.72/1.98 0 [] axiom(or(not(or(A,B)),or(B,A))).
% 1.72/1.98 0 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.72/1.98 0 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.72/1.98 0 [] theorem(X)| -axiom(X).
% 1.72/1.98 0 [] theorem(X)| -axiom(or(not(Y),X))| -theorem(Y).
% 1.72/1.98 0 [] theorem(or(not(X),Z))| -axiom(or(not(X),Y))| -theorem(or(not(Y),Z)).
% 1.72/1.98 0 [] -theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))).
% 1.72/1.98 end_of_list.
% 1.72/1.98
% 1.72/1.98 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.72/1.98
% 1.72/1.98 This is a Horn set without equality. The strategy will
% 1.72/1.98 be hyperresolution, with satellites in sos and nuclei
% 1.72/1.98 in usable.
% 1.72/1.98
% 1.72/1.98 dependent: set(hyper_res).
% 1.72/1.98 dependent: clear(order_hyper).
% 1.72/1.98
% 1.72/1.98 ------------> process usable:
% 1.72/1.98 ** KEPT (pick-wt=4): 1 [] theorem(A)| -axiom(A).
% 1.72/1.98 ** KEPT (pick-wt=9): 2 [] theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 1.72/1.98 ** KEPT (pick-wt=15): 3 [] theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 1.72/1.98 ** KEPT (pick-wt=13): 4 [] -theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))).
% 1.72/1.98
% 1.72/1.98 ------------> process sos:
% 1.72/1.98 ** KEPT (pick-wt=7): 5 [] axiom(or(not(or(A,A)),A)).
% 1.72/1.98 ** KEPT (pick-wt=7): 6 [] axiom(or(not(A),or(B,A))).
% 1.72/1.98 ** KEPT (pick-wt=9): 7 [] axiom(or(not(or(A,B)),or(B,A))).
% 1.72/1.98 ** KEPT (pick-wt=13): 8 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.72/1.98 ** KEPT (pick-wt=15): 9 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.72/1.98
% 1.72/1.98 ======= end of input processing =======
% 1.72/1.98
% 1.72/1.98 =========== start of search ===========
% 1.72/1.98
% 1.72/1.98 -------- PROOF --------
% 1.72/1.98
% 1.72/1.98 ----> UNIT CONFLICT at 0.05 sec ----> 1649 [binary,1648.1,4.1] $F.
% 1.72/1.98
% 1.72/1.98 Length of proof is 8. Level of proof is 8.
% 1.72/1.98
% 1.72/1.98 ---------------- PROOF ----------------
% 1.72/1.98 % SZS status Unsatisfiable
% 1.72/1.98 % SZS output start Refutation
% See solution above
% 1.72/1.98 ------------ end of proof -------------
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98 Search stopped by max_proofs option.
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98 Search stopped by max_proofs option.
% 1.72/1.98
% 1.72/1.98 ============ end of search ============
% 1.72/1.98
% 1.72/1.98 -------------- statistics -------------
% 1.72/1.98 clauses given 413
% 1.72/1.98 clauses generated 2816
% 1.72/1.98 clauses kept 1648
% 1.72/1.98 clauses forward subsumed 1177
% 1.72/1.98 clauses back subsumed 97
% 1.72/1.98 Kbytes malloced 3906
% 1.72/1.98
% 1.72/1.98 ----------- times (seconds) -----------
% 1.72/1.98 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 1.72/1.98 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.98 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.98
% 1.72/1.98 That finishes the proof of the theorem.
% 1.72/1.98
% 1.72/1.98 Process 10776 finished Wed Jul 27 09:11:54 2022
% 1.72/1.98 Otter interrupted
% 1.72/1.98 PROOF FOUND
%------------------------------------------------------------------------------