TSTP Solution File: LCL215-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL215-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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:56 EDT 2022
% Result : Unsatisfiable 1.80s 2.03s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 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 : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( theorem(A)
| ~ axiom(A) ),
file('LCL215-1.p',unknown),
[] ).
cnf(2,axiom,
( theorem(A)
| ~ axiom(or(not(B),A))
| ~ theorem(B) ),
file('LCL215-1.p',unknown),
[] ).
cnf(3,axiom,
( theorem(or(not(A),B))
| ~ axiom(or(not(A),C))
| ~ theorem(or(not(C),B)) ),
file('LCL215-1.p',unknown),
[] ).
cnf(4,axiom,
~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))),
file('LCL215-1.p',unknown),
[] ).
cnf(5,axiom,
axiom(or(not(or(A,A)),A)),
file('LCL215-1.p',unknown),
[] ).
cnf(7,axiom,
axiom(or(not(or(A,B)),or(B,A))),
file('LCL215-1.p',unknown),
[] ).
cnf(8,axiom,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file('LCL215-1.p',unknown),
[] ).
cnf(9,axiom,
axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file('LCL215-1.p',unknown),
[] ).
cnf(10,plain,
theorem(or(not(or(A,A)),A)),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(62,plain,
theorem(or(not(or(A,or(B,B))),or(A,B))),
inference(hyper,[status(thm)],[9,2,10]),
[iquote('hyper,9,2,10')] ).
cnf(445,plain,
theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))),
inference(hyper,[status(thm)],[62,3,9]),
[iquote('hyper,62,3,9')] ).
cnf(2277,plain,
theorem(or(not(or(A,B)),or(not(or(not(B),A)),A))),
inference(hyper,[status(thm)],[445,2,8]),
[iquote('hyper,445,2,8')] ).
cnf(3043,plain,
theorem(or(not(or(A,B)),or(not(or(not(A),B)),B))),
inference(hyper,[status(thm)],[2277,3,7]),
[iquote('hyper,2277,3,7')] ).
cnf(3366,plain,
theorem(or(not(or(not(A),B)),or(not(or(A,B)),B))),
inference(hyper,[status(thm)],[3043,2,8]),
[iquote('hyper,3043,2,8')] ).
cnf(3367,plain,
$false,
inference(binary,[status(thm)],[3366,4]),
[iquote('binary,3366.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL215-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 08:52:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.80/2.03 ----- Otter 3.3f, August 2004 -----
% 1.80/2.03 The process was started by sandbox2 on n017.cluster.edu,
% 1.80/2.03 Wed Jul 27 08:52:48 2022
% 1.80/2.03 The command was "./otter". The process ID is 29733.
% 1.80/2.03
% 1.80/2.03 set(prolog_style_variables).
% 1.80/2.03 set(auto).
% 1.80/2.03 dependent: set(auto1).
% 1.80/2.03 dependent: set(process_input).
% 1.80/2.03 dependent: clear(print_kept).
% 1.80/2.03 dependent: clear(print_new_demod).
% 1.80/2.03 dependent: clear(print_back_demod).
% 1.80/2.03 dependent: clear(print_back_sub).
% 1.80/2.03 dependent: set(control_memory).
% 1.80/2.03 dependent: assign(max_mem, 12000).
% 1.80/2.03 dependent: assign(pick_given_ratio, 4).
% 1.80/2.03 dependent: assign(stats_level, 1).
% 1.80/2.03 dependent: assign(max_seconds, 10800).
% 1.80/2.03 clear(print_given).
% 1.80/2.03
% 1.80/2.03 list(usable).
% 1.80/2.03 0 [] axiom(or(not(or(A,A)),A)).
% 1.80/2.03 0 [] axiom(or(not(A),or(B,A))).
% 1.80/2.03 0 [] axiom(or(not(or(A,B)),or(B,A))).
% 1.80/2.03 0 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.80/2.03 0 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.80/2.03 0 [] theorem(X)| -axiom(X).
% 1.80/2.03 0 [] theorem(X)| -axiom(or(not(Y),X))| -theorem(Y).
% 1.80/2.03 0 [] theorem(or(not(X),Z))| -axiom(or(not(X),Y))| -theorem(or(not(Y),Z)).
% 1.80/2.03 0 [] -theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))).
% 1.80/2.03 end_of_list.
% 1.80/2.03
% 1.80/2.03 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.80/2.03
% 1.80/2.03 This is a Horn set without equality. The strategy will
% 1.80/2.03 be hyperresolution, with satellites in sos and nuclei
% 1.80/2.03 in usable.
% 1.80/2.03
% 1.80/2.03 dependent: set(hyper_res).
% 1.80/2.03 dependent: clear(order_hyper).
% 1.80/2.03
% 1.80/2.03 ------------> process usable:
% 1.80/2.03 ** KEPT (pick-wt=4): 1 [] theorem(A)| -axiom(A).
% 1.80/2.03 ** KEPT (pick-wt=9): 2 [] theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 1.80/2.03 ** KEPT (pick-wt=15): 3 [] theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 1.80/2.03 ** KEPT (pick-wt=13): 4 [] -theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))).
% 1.80/2.03
% 1.80/2.03 ------------> process sos:
% 1.80/2.03 ** KEPT (pick-wt=7): 5 [] axiom(or(not(or(A,A)),A)).
% 1.80/2.03 ** KEPT (pick-wt=7): 6 [] axiom(or(not(A),or(B,A))).
% 1.80/2.03 ** KEPT (pick-wt=9): 7 [] axiom(or(not(or(A,B)),or(B,A))).
% 1.80/2.03 ** KEPT (pick-wt=13): 8 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.80/2.03 ** KEPT (pick-wt=15): 9 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.80/2.03
% 1.80/2.03 ======= end of input processing =======
% 1.80/2.03
% 1.80/2.03 =========== start of search ===========
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Resetting weight limit to 13.
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Resetting weight limit to 13.
% 1.80/2.03
% 1.80/2.03 sos_size=1577
% 1.80/2.03
% 1.80/2.03 -------- PROOF --------
% 1.80/2.03
% 1.80/2.03 ----> UNIT CONFLICT at 0.14 sec ----> 3367 [binary,3366.1,4.1] $F.
% 1.80/2.03
% 1.80/2.03 Length of proof is 6. Level of proof is 6.
% 1.80/2.03
% 1.80/2.03 ---------------- PROOF ----------------
% 1.80/2.03 % SZS status Unsatisfiable
% 1.80/2.03 % SZS output start Refutation
% See solution above
% 1.80/2.03 ------------ end of proof -------------
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Search stopped by max_proofs option.
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Search stopped by max_proofs option.
% 1.80/2.03
% 1.80/2.03 ============ end of search ============
% 1.80/2.03
% 1.80/2.03 -------------- statistics -------------
% 1.80/2.03 clauses given 2190
% 1.80/2.03 clauses generated 14648
% 1.80/2.03 clauses kept 3366
% 1.80/2.03 clauses forward subsumed 3574
% 1.80/2.03 clauses back subsumed 101
% 1.80/2.03 Kbytes malloced 5859
% 1.80/2.03
% 1.80/2.03 ----------- times (seconds) -----------
% 1.80/2.03 user CPU time 0.14 (0 hr, 0 min, 0 sec)
% 1.80/2.03 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.80/2.03 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.80/2.03
% 1.80/2.03 That finishes the proof of the theorem.
% 1.80/2.03
% 1.80/2.03 Process 29733 finished Wed Jul 27 08:52:50 2022
% 1.80/2.03 Otter interrupted
% 1.80/2.03 PROOF FOUND
%------------------------------------------------------------------------------