TSTP Solution File: LCL230+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL230+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:59 EDT 2022
% Result : Theorem 1.97s 2.13s
% Output : Refutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 2 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ q
| p
| r ),
file('LCL230+1.p',unknown),
[] ).
cnf(2,axiom,
~ p,
file('LCL230+1.p',unknown),
[] ).
cnf(3,axiom,
~ r,
file('LCL230+1.p',unknown),
[] ).
cnf(4,axiom,
q,
file('LCL230+1.p',unknown),
[] ).
cnf(5,plain,
( p
| r ),
inference(hyper,[status(thm)],[4,1]),
[iquote('hyper,4,1')] ).
cnf(6,plain,
p,
inference(hyper,[status(thm)],[5,3]),
[iquote('hyper,5,3')] ).
cnf(7,plain,
$false,
inference(binary,[status(thm)],[6,2]),
[iquote('binary,6.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL230+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 09:43:33 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.97/2.13 ----- Otter 3.3f, August 2004 -----
% 1.97/2.13 The process was started by sandbox on n023.cluster.edu,
% 1.97/2.13 Wed Jul 27 09:43:33 2022
% 1.97/2.13 The command was "./otter". The process ID is 12918.
% 1.97/2.13
% 1.97/2.13 set(prolog_style_variables).
% 1.97/2.13 set(auto).
% 1.97/2.13 dependent: set(auto1).
% 1.97/2.13 dependent: set(process_input).
% 1.97/2.13 dependent: clear(print_kept).
% 1.97/2.13 dependent: clear(print_new_demod).
% 1.97/2.13 dependent: clear(print_back_demod).
% 1.97/2.13 dependent: clear(print_back_sub).
% 1.97/2.13 dependent: set(control_memory).
% 1.97/2.13 dependent: assign(max_mem, 12000).
% 1.97/2.13 dependent: assign(pick_given_ratio, 4).
% 1.97/2.13 dependent: assign(stats_level, 1).
% 1.97/2.13 dependent: assign(max_seconds, 10800).
% 1.97/2.13 clear(print_given).
% 1.97/2.13
% 1.97/2.13 formula_list(usable).
% 1.97/2.13 -((p|q->p|r)->p| (q->r)).
% 1.97/2.13 end_of_list.
% 1.97/2.13
% 1.97/2.13 -------> usable clausifies to:
% 1.97/2.13
% 1.97/2.13 list(usable).
% 1.97/2.13 0 [] -q|p|r.
% 1.97/2.13 0 [] -p.
% 1.97/2.13 0 [] q.
% 1.97/2.13 0 [] -r.
% 1.97/2.13 end_of_list.
% 1.97/2.13
% 1.97/2.13 SCAN INPUT: prop=1, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.97/2.13
% 1.97/2.13 The clause set is propositional; the strategy will be
% 1.97/2.13 ordered hyperresolution with the propositional
% 1.97/2.13 optimizations, with satellites in sos and nuclei in usable.
% 1.97/2.13
% 1.97/2.13 dependent: set(hyper_res).
% 1.97/2.13 dependent: set(propositional).
% 1.97/2.13 dependent: set(sort_literals).
% 1.97/2.13
% 1.97/2.13 ------------> process usable:
% 1.97/2.13 ** KEPT (pick-wt=3): 1 [] -q|p|r.
% 1.97/2.13 ** KEPT (pick-wt=1): 2 [] -p.
% 1.97/2.13 ** KEPT (pick-wt=1): 3 [] -r.
% 1.97/2.13
% 1.97/2.13 ------------> process sos:
% 1.97/2.13 ** KEPT (pick-wt=1): 4 [] q.
% 1.97/2.13
% 1.97/2.13 ======= end of input processing =======
% 1.97/2.13
% 1.97/2.13 =========== start of search ===========
% 1.97/2.13
% 1.97/2.13 -------- PROOF --------
% 1.97/2.13
% 1.97/2.13 ----> UNIT CONFLICT at 0.00 sec ----> 7 [binary,6.1,2.1] $F.
% 1.97/2.13
% 1.97/2.13 Length of proof is 2. Level of proof is 2.
% 1.97/2.13
% 1.97/2.13 ---------------- PROOF ----------------
% 1.97/2.13 % SZS status Theorem
% 1.97/2.13 % SZS output start Refutation
% See solution above
% 1.97/2.13 ------------ end of proof -------------
% 1.97/2.13
% 1.97/2.13
% 1.97/2.13 Search stopped by max_proofs option.
% 1.97/2.13
% 1.97/2.13
% 1.97/2.13 Search stopped by max_proofs option.
% 1.97/2.13
% 1.97/2.13 ============ end of search ============
% 1.97/2.13
% 1.97/2.13 -------------- statistics -------------
% 1.97/2.13 clauses given 2
% 1.97/2.13 clauses generated 2
% 1.97/2.13 clauses kept 6
% 1.97/2.13 clauses forward subsumed 0
% 1.97/2.13 clauses back subsumed 1
% 1.97/2.13 Kbytes malloced 976
% 1.97/2.13
% 1.97/2.13 ----------- times (seconds) -----------
% 1.97/2.13 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.13 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.97/2.13
% 1.97/2.13 That finishes the proof of the theorem.
% 1.97/2.13
% 1.97/2.13 Process 12918 finished Wed Jul 27 09:43:35 2022
% 1.97/2.13 Otter interrupted
% 1.97/2.13 PROOF FOUND
%------------------------------------------------------------------------------