TSTP Solution File: LCL115-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL115-1 : 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:36 EDT 2022
% Result : Unsatisfiable 2.00s 2.21s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 22 unt; 0 nHn; 3 RR)
% Number of literals : 25 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL115-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
file('LCL115-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(A,implies(B,A))),
file('LCL115-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
file('LCL115-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))),
file('LCL115-1.p',unknown),
[] ).
cnf(6,axiom,
is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))),
file('LCL115-1.p',unknown),
[] ).
cnf(7,plain,
is_a_theorem(implies(A,implies(B,implies(C,B)))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(15,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(B),not(A)),C))),
inference(hyper,[status(thm)],[4,1,6]),
[iquote('hyper,4,1,6')] ).
cnf(16,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(20,plain,
is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)),
inference(hyper,[status(thm)],[5,1,7]),
[iquote('hyper,5,1,7')] ).
cnf(23,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(hyper,[status(thm)],[16,1,6]),
[iquote('hyper,16,1,6')] ).
cnf(24,plain,
is_a_theorem(implies(A,implies(implies(A,B),B))),
inference(hyper,[status(thm)],[16,1,5]),
[iquote('hyper,16,1,5')] ).
cnf(27,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
inference(hyper,[status(thm)],[23,1,4]),
[iquote('hyper,23,1,4')] ).
cnf(59,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[20,1,16]),
[iquote('hyper,20,1,16')] ).
cnf(63,plain,
is_a_theorem(implies(implies(implies(A,A),B),B)),
inference(hyper,[status(thm)],[59,1,24]),
[iquote('hyper,59,1,24')] ).
cnf(348,plain,
is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)),
inference(hyper,[status(thm)],[15,1,63]),
[iquote('hyper,15,1,63')] ).
cnf(418,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(hyper,[status(thm)],[348,1,27]),
[iquote('hyper,348,1,27')] ).
cnf(433,plain,
is_a_theorem(implies(A,not(not(A)))),
inference(hyper,[status(thm)],[418,1,6]),
[iquote('hyper,418,1,6')] ).
cnf(434,plain,
is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))),
inference(hyper,[status(thm)],[418,1,4]),
[iquote('hyper,418,1,4')] ).
cnf(455,plain,
is_a_theorem(implies(A,not(not(implies(B,A))))),
inference(hyper,[status(thm)],[433,1,16]),
[iquote('hyper,433,1,16')] ).
cnf(1274,plain,
is_a_theorem(implies(not(not(A)),not(not(implies(B,A))))),
inference(hyper,[status(thm)],[434,1,455]),
[iquote('hyper,434,1,455')] ).
cnf(2171,plain,
is_a_theorem(implies(not(implies(A,B)),not(B))),
inference(hyper,[status(thm)],[1274,1,6]),
[iquote('hyper,1274,1,6')] ).
cnf(2172,plain,
$false,
inference(binary,[status(thm)],[2171,2]),
[iquote('binary,2171.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL115-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 09:14:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.00/2.21 ----- Otter 3.3f, August 2004 -----
% 2.00/2.21 The process was started by sandbox on n020.cluster.edu,
% 2.00/2.21 Wed Jul 27 09:14:38 2022
% 2.00/2.21 The command was "./otter". The process ID is 29369.
% 2.00/2.21
% 2.00/2.21 set(prolog_style_variables).
% 2.00/2.21 set(auto).
% 2.00/2.21 dependent: set(auto1).
% 2.00/2.21 dependent: set(process_input).
% 2.00/2.21 dependent: clear(print_kept).
% 2.00/2.21 dependent: clear(print_new_demod).
% 2.00/2.21 dependent: clear(print_back_demod).
% 2.00/2.21 dependent: clear(print_back_sub).
% 2.00/2.21 dependent: set(control_memory).
% 2.00/2.21 dependent: assign(max_mem, 12000).
% 2.00/2.21 dependent: assign(pick_given_ratio, 4).
% 2.00/2.21 dependent: assign(stats_level, 1).
% 2.00/2.21 dependent: assign(max_seconds, 10800).
% 2.00/2.21 clear(print_given).
% 2.00/2.21
% 2.00/2.21 list(usable).
% 2.00/2.21 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.00/2.21 0 [] is_a_theorem(implies(X,implies(Y,X))).
% 2.00/2.21 0 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 2.00/2.21 0 [] is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))).
% 2.00/2.21 0 [] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 2.00/2.21 0 [] -is_a_theorem(implies(not(implies(a,b)),not(b))).
% 2.00/2.21 end_of_list.
% 2.00/2.21
% 2.00/2.21 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.00/2.21
% 2.00/2.21 This is a Horn set without equality. The strategy will
% 2.00/2.21 be hyperresolution, with satellites in sos and nuclei
% 2.00/2.21 in usable.
% 2.00/2.21
% 2.00/2.21 dependent: set(hyper_res).
% 2.00/2.21 dependent: clear(order_hyper).
% 2.00/2.21
% 2.00/2.21 ------------> process usable:
% 2.00/2.21 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.00/2.21 ** KEPT (pick-wt=8): 2 [] -is_a_theorem(implies(not(implies(a,b)),not(b))).
% 2.00/2.21
% 2.00/2.21 ------------> process sos:
% 2.00/2.21 ** KEPT (pick-wt=6): 3 [] is_a_theorem(implies(A,implies(B,A))).
% 2.00/2.21 ** KEPT (pick-wt=12): 4 [] is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 2.00/2.21 ** KEPT (pick-wt=12): 5 [] is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))).
% 2.00/2.21 ** KEPT (pick-wt=10): 6 [] is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 2.00/2.21
% 2.00/2.21 ======= end of input processing =======
% 2.00/2.21
% 2.00/2.21 =========== start of search ===========
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Resetting weight limit to 11.
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Resetting weight limit to 11.
% 2.00/2.21
% 2.00/2.21 sos_size=2033
% 2.00/2.21
% 2.00/2.21 -------- PROOF --------
% 2.00/2.21
% 2.00/2.21 ----> UNIT CONFLICT at 0.08 sec ----> 2172 [binary,2171.1,2.1] $F.
% 2.00/2.21
% 2.00/2.21 Length of proof is 16. Level of proof is 10.
% 2.00/2.21
% 2.00/2.21 ---------------- PROOF ----------------
% 2.00/2.21 % SZS status Unsatisfiable
% 2.00/2.21 % SZS output start Refutation
% See solution above
% 2.00/2.21 ------------ end of proof -------------
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21 ============ end of search ============
% 2.00/2.21
% 2.00/2.21 -------------- statistics -------------
% 2.00/2.21 clauses given 153
% 2.00/2.21 clauses generated 12715
% 2.00/2.21 clauses kept 2171
% 2.00/2.21 clauses forward subsumed 8010
% 2.00/2.21 clauses back subsumed 8
% 2.00/2.21 Kbytes malloced 4882
% 2.00/2.21
% 2.00/2.21 ----------- times (seconds) -----------
% 2.00/2.21 user CPU time 0.08 (0 hr, 0 min, 0 sec)
% 2.00/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.21 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.21
% 2.00/2.21 That finishes the proof of the theorem.
% 2.00/2.21
% 2.00/2.21 Process 29369 finished Wed Jul 27 09:14:40 2022
% 2.00/2.21 Otter interrupted
% 2.00/2.21 PROOF FOUND
%------------------------------------------------------------------------------