TSTP Solution File: LCL080-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL080-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:29 EDT 2022
% Result : Unsatisfiable 2.41s 2.58s
% Output : Refutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 22 ( 21 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 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; 4 con; 0-2 aty)
% Number of variables : 59 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL080-2.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
file('LCL080-2.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(A,implies(B,A))),
file('LCL080-2.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(implies(implies(A,B),A),A)),
file('LCL080-2.p',unknown),
[] ).
cnf(6,axiom,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
file('LCL080-2.p',unknown),
[] ).
cnf(10,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
inference(hyper,[status(thm)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(12,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))),
inference(hyper,[status(thm)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(17,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(hyper,[status(thm)],[6,1,4]),
[iquote('hyper,6,1,4')] ).
cnf(20,plain,
is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),implies(D,C))),
inference(hyper,[status(thm)],[10,1,6]),
[iquote('hyper,10,1,6')] ).
cnf(26,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))),
inference(hyper,[status(thm)],[12,1,12]),
[iquote('hyper,12,1,12')] ).
cnf(30,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
inference(hyper,[status(thm)],[12,1,5]),
[iquote('hyper,12,1,5')] ).
cnf(34,plain,
is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))),
inference(hyper,[status(thm)],[17,1,6]),
[iquote('hyper,17,1,6')] ).
cnf(51,plain,
is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))),
inference(hyper,[status(thm)],[30,1,12]),
[iquote('hyper,30,1,12')] ).
cnf(174,plain,
is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)),
inference(hyper,[status(thm)],[20,1,30]),
[iquote('hyper,20,1,30')] ).
cnf(210,plain,
is_a_theorem(implies(A,implies(implies(A,B),B))),
inference(hyper,[status(thm)],[51,1,17]),
[iquote('hyper,51,1,17')] ).
cnf(389,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[26,1,210]),
[iquote('hyper,26,1,210')] ).
cnf(399,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,implies(D,C))))),
inference(hyper,[status(thm)],[26,1,34]),
[iquote('hyper,26,1,34')] ).
cnf(848,plain,
is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))),
inference(hyper,[status(thm)],[174,1,12]),
[iquote('hyper,174,1,12')] ).
cnf(1697,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))),
inference(hyper,[status(thm)],[848,1,12]),
[iquote('hyper,848,1,12')] ).
cnf(3151,plain,
is_a_theorem(implies(implies(A,B),implies(implies(implies(B,C),A),B))),
inference(hyper,[status(thm)],[1697,1,389]),
[iquote('hyper,1697,1,389')] ).
cnf(6854,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))),
inference(hyper,[status(thm)],[399,1,3151]),
[iquote('hyper,399,1,3151')] ).
cnf(6855,plain,
$false,
inference(binary,[status(thm)],[6854,2]),
[iquote('binary,6854.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL080-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:14:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.41/2.58 ----- Otter 3.3f, August 2004 -----
% 2.41/2.58 The process was started by sandbox on n020.cluster.edu,
% 2.41/2.58 Wed Jul 27 09:14:53 2022
% 2.41/2.58 The command was "./otter". The process ID is 30852.
% 2.41/2.58
% 2.41/2.58 set(prolog_style_variables).
% 2.41/2.58 set(auto).
% 2.41/2.58 dependent: set(auto1).
% 2.41/2.58 dependent: set(process_input).
% 2.41/2.58 dependent: clear(print_kept).
% 2.41/2.58 dependent: clear(print_new_demod).
% 2.41/2.58 dependent: clear(print_back_demod).
% 2.41/2.58 dependent: clear(print_back_sub).
% 2.41/2.58 dependent: set(control_memory).
% 2.41/2.58 dependent: assign(max_mem, 12000).
% 2.41/2.58 dependent: assign(pick_given_ratio, 4).
% 2.41/2.58 dependent: assign(stats_level, 1).
% 2.41/2.58 dependent: assign(max_seconds, 10800).
% 2.41/2.58 clear(print_given).
% 2.41/2.58
% 2.41/2.58 list(usable).
% 2.41/2.58 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.41/2.58 0 [] is_a_theorem(implies(X,X)).
% 2.41/2.58 0 [] is_a_theorem(implies(X,implies(Y,X))).
% 2.41/2.58 0 [] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 2.41/2.58 0 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 2.41/2.58 0 [] -is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))).
% 2.41/2.58 end_of_list.
% 2.41/2.58
% 2.41/2.58 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.41/2.58
% 2.41/2.58 This is a Horn set without equality. The strategy will
% 2.41/2.58 be hyperresolution, with satellites in sos and nuclei
% 2.41/2.58 in usable.
% 2.41/2.58
% 2.41/2.58 dependent: set(hyper_res).
% 2.41/2.58 dependent: clear(order_hyper).
% 2.41/2.58
% 2.41/2.58 ------------> process usable:
% 2.41/2.58 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.41/2.58 ** KEPT (pick-wt=14): 2 [] -is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))).
% 2.41/2.58
% 2.41/2.58 ------------> process sos:
% 2.41/2.58 ** KEPT (pick-wt=4): 3 [] is_a_theorem(implies(A,A)).
% 2.41/2.58 ** KEPT (pick-wt=6): 4 [] is_a_theorem(implies(A,implies(B,A))).
% 2.41/2.58 ** KEPT (pick-wt=8): 5 [] is_a_theorem(implies(implies(implies(A,B),A),A)).
% 2.41/2.58 ** KEPT (pick-wt=12): 6 [] is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 2.41/2.58
% 2.41/2.58 ======= end of input processing =======
% 2.41/2.58
% 2.41/2.58 =========== start of search ===========
% 2.41/2.58
% 2.41/2.58
% 2.41/2.58 Resetting weight limit to 16.
% 2.41/2.58
% 2.41/2.58
% 2.41/2.58 Resetting weight limit to 16.
% 2.41/2.58
% 2.41/2.58 sos_size=6510
% 2.41/2.58
% 2.41/2.58 -------- PROOF --------
% 2.41/2.58
% 2.41/2.58 ----> UNIT CONFLICT at 0.41 sec ----> 6855 [binary,6854.1,2.1] $F.
% 2.41/2.58
% 2.41/2.58 Length of proof is 16. Level of proof is 7.
% 2.41/2.58
% 2.41/2.58 ---------------- PROOF ----------------
% 2.41/2.58 % SZS status Unsatisfiable
% 2.41/2.58 % SZS output start Refutation
% See solution above
% 2.41/2.58 ------------ end of proof -------------
% 2.41/2.58
% 2.41/2.58
% 2.41/2.58 Search stopped by max_proofs option.
% 2.41/2.58
% 2.41/2.58
% 2.41/2.58 Search stopped by max_proofs option.
% 2.41/2.58
% 2.41/2.58 ============ end of search ============
% 2.41/2.58
% 2.41/2.58 -------------- statistics -------------
% 2.41/2.58 clauses given 239
% 2.41/2.58 clauses generated 52407
% 2.41/2.58 clauses kept 6854
% 2.41/2.58 clauses forward subsumed 35266
% 2.41/2.58 clauses back subsumed 28
% 2.41/2.58 Kbytes malloced 4882
% 2.41/2.58
% 2.41/2.58 ----------- times (seconds) -----------
% 2.41/2.58 user CPU time 0.41 (0 hr, 0 min, 0 sec)
% 2.41/2.58 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.41/2.58 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.41/2.58
% 2.41/2.58 That finishes the proof of the theorem.
% 2.41/2.58
% 2.41/2.58 Process 30852 finished Wed Jul 27 09:14:55 2022
% 2.41/2.59 Otter interrupted
% 2.41/2.59 PROOF FOUND
%------------------------------------------------------------------------------