TSTP Solution File: LCL070-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL070-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:27 EDT 2022
% Result : Unsatisfiable 2.69s 2.89s
% Output : Refutation 2.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 20 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL070-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('LCL070-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
file('LCL070-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
file('LCL070-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(implies(A,implies(not(B),C)),implies(A,implies(implies(D,C),implies(implies(B,D),C))))),
file('LCL070-1.p',unknown),
[] ).
cnf(6,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(8,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(48,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(D,C),implies(implies(A,D),C)))),
inference(hyper,[status(thm)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(163,plain,
is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(implies(C,A),implies(B,implies(C,D))))),
inference(hyper,[status(thm)],[48,1,6]),
[iquote('hyper,48,1,6')] ).
cnf(166,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(implies(D,B),A),implies(B,C)))),
inference(hyper,[status(thm)],[48,1,3]),
[iquote('hyper,48,1,3')] ).
cnf(227,plain,
is_a_theorem(implies(implies(implies(A,B),implies(implies(C,B),D)),implies(B,D))),
inference(hyper,[status(thm)],[166,1,3]),
[iquote('hyper,166,1,3')] ).
cnf(304,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[227,1,3]),
[iquote('hyper,227,1,3')] ).
cnf(336,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(B,A),implies(B,C)))),
inference(hyper,[status(thm)],[304,1,48]),
[iquote('hyper,304,1,48')] ).
cnf(481,plain,
is_a_theorem(implies(implies(A,B),implies(A,implies(C,B)))),
inference(hyper,[status(thm)],[336,1,8]),
[iquote('hyper,336,1,8')] ).
cnf(4735,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[163,1,481]),
[iquote('hyper,163,1,481')] ).
cnf(5568,plain,
is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))),
inference(hyper,[status(thm)],[4735,1,481]),
[iquote('hyper,4735,1,481')] ).
cnf(5735,plain,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
inference(hyper,[status(thm)],[5568,1,163]),
[iquote('hyper,5568,1,163')] ).
cnf(5736,plain,
$false,
inference(binary,[status(thm)],[5735,2]),
[iquote('binary,5735.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL070-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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:32:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.69/2.89 ----- Otter 3.3f, August 2004 -----
% 2.69/2.89 The process was started by sandbox2 on n027.cluster.edu,
% 2.69/2.89 Wed Jul 27 09:32:37 2022
% 2.69/2.89 The command was "./otter". The process ID is 16619.
% 2.69/2.89
% 2.69/2.89 set(prolog_style_variables).
% 2.69/2.89 set(auto).
% 2.69/2.89 dependent: set(auto1).
% 2.69/2.89 dependent: set(process_input).
% 2.69/2.89 dependent: clear(print_kept).
% 2.69/2.89 dependent: clear(print_new_demod).
% 2.69/2.89 dependent: clear(print_back_demod).
% 2.69/2.89 dependent: clear(print_back_sub).
% 2.69/2.89 dependent: set(control_memory).
% 2.69/2.89 dependent: assign(max_mem, 12000).
% 2.69/2.89 dependent: assign(pick_given_ratio, 4).
% 2.69/2.89 dependent: assign(stats_level, 1).
% 2.69/2.89 dependent: assign(max_seconds, 10800).
% 2.69/2.89 clear(print_given).
% 2.69/2.89
% 2.69/2.89 list(usable).
% 2.69/2.89 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.69/2.89 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 2.69/2.89 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 2.69/2.89 0 [] is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(X,implies(implies(U,Z),implies(implies(Y,U),Z))))).
% 2.69/2.89 0 [] -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 2.69/2.89 end_of_list.
% 2.69/2.89
% 2.69/2.89 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.69/2.89
% 2.69/2.89 This is a Horn set without equality. The strategy will
% 2.69/2.89 be hyperresolution, with satellites in sos and nuclei
% 2.69/2.89 in usable.
% 2.69/2.89
% 2.69/2.89 dependent: set(hyper_res).
% 2.69/2.89 dependent: clear(order_hyper).
% 2.69/2.89
% 2.69/2.89 ------------> process usable:
% 2.69/2.89 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.69/2.89 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 2.69/2.89
% 2.69/2.89 ------------> process sos:
% 2.69/2.89 ** KEPT (pick-wt=10): 3 [] is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 2.69/2.89 ** KEPT (pick-wt=11): 4 [] is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 2.69/2.89 ** KEPT (pick-wt=19): 5 [] is_a_theorem(implies(implies(A,implies(not(B),C)),implies(A,implies(implies(D,C),implies(implies(B,D),C))))).
% 2.69/2.89
% 2.69/2.89 ======= end of input processing =======
% 2.69/2.89
% 2.69/2.89 =========== start of search ===========
% 2.69/2.89
% 2.69/2.89
% 2.69/2.89 Resetting weight limit to 15.
% 2.69/2.89
% 2.69/2.89
% 2.69/2.89 Resetting weight limit to 15.
% 2.69/2.89
% 2.69/2.89 sos_size=3791
% 2.69/2.89
% 2.69/2.89
% 2.69/2.89 Resetting weight limit to 13.
% 2.69/2.89
% 2.69/2.89
% 2.69/2.89 Resetting weight limit to 13.
% 2.69/2.89
% 2.69/2.89 sos_size=4304
% 2.69/2.89
% 2.69/2.89
% 2.69/2.89 Resetting weight limit to 12.
% 2.69/2.89
% 2.69/2.89
% 2.69/2.89 Resetting weight limit to 12.
% 2.69/2.89
% 2.69/2.89 sos_size=4528
% 2.69/2.89
% 2.69/2.89 -------- PROOF --------
% 2.69/2.89
% 2.69/2.89 ----> UNIT CONFLICT at 1.09 sec ----> 5736 [binary,5735.1,2.1] $F.
% 2.69/2.89
% 2.69/2.89 Length of proof is 12. Level of proof is 9.
% 2.69/2.89
% 2.69/2.89 ---------------- PROOF ----------------
% 2.69/2.89 % SZS status Unsatisfiable
% 2.69/2.89 % SZS output start Refutation
% See solution above
% 2.69/2.89 ------------ end of proof -------------
% 2.69/2.89
% 2.69/2.89
% 2.69/2.89 Search stopped by max_proofs option.
% 2.69/2.89
% 2.69/2.89
% 2.69/2.89 Search stopped by max_proofs option.
% 2.69/2.89
% 2.69/2.89 ============ end of search ============
% 2.69/2.89
% 2.69/2.89 -------------- statistics -------------
% 2.69/2.89 clauses given 903
% 2.69/2.89 clauses generated 427166
% 2.69/2.89 clauses kept 5735
% 2.69/2.89 clauses forward subsumed 234014
% 2.69/2.89 clauses back subsumed 145
% 2.69/2.89 Kbytes malloced 6835
% 2.69/2.89
% 2.69/2.89 ----------- times (seconds) -----------
% 2.69/2.89 user CPU time 1.09 (0 hr, 0 min, 1 sec)
% 2.69/2.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.69/2.89 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.69/2.89
% 2.69/2.89 That finishes the proof of the theorem.
% 2.69/2.89
% 2.69/2.89 Process 16619 finished Wed Jul 27 09:32:39 2022
% 2.69/2.89 Otter interrupted
% 2.69/2.89 PROOF FOUND
%------------------------------------------------------------------------------