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