TSTP Solution File: LCL381-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL381-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:04:19 EDT 2022
% Result : Unsatisfiable 1.75s 1.95s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of clauses : 36 ( 35 unt; 0 nHn; 3 RR)
% Number of literals : 38 ( 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 : 93 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL381-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(implies(not(not(x)),y),z),implies(implies(x,y),z))),
file('LCL381-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
file('LCL381-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(implies(not(A),A),A)),
file('LCL381-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(implies(A,implies(not(A),B))),
file('LCL381-1.p',unknown),
[] ).
cnf(6,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(7,plain,
is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(9,plain,
is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(16,plain,
is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))),
inference(hyper,[status(thm)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(20,plain,
is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),D),implies(implies(B,C),D)))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(30,plain,
is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(35,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[9,1,6]),
[iquote('hyper,9,1,6')] ).
cnf(40,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[9,1,4]),
[iquote('hyper,9,1,4')] ).
cnf(42,plain,
is_a_theorem(implies(not(implies(A,A)),B)),
inference(hyper,[status(thm)],[40,1,5]),
[iquote('hyper,40,1,5')] ).
cnf(67,plain,
is_a_theorem(implies(A,implies(B,implies(not(A),C)))),
inference(hyper,[status(thm)],[35,1,9]),
[iquote('hyper,35,1,9')] ).
cnf(70,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))),
inference(hyper,[status(thm)],[35,1,3]),
[iquote('hyper,35,1,3')] ).
cnf(72,plain,
is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
inference(hyper,[status(thm)],[35,1,42]),
[iquote('hyper,35,1,42')] ).
cnf(85,plain,
is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))),
inference(hyper,[status(thm)],[67,1,3]),
[iquote('hyper,67,1,3')] ).
cnf(99,plain,
is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))),
inference(hyper,[status(thm)],[72,1,3]),
[iquote('hyper,72,1,3')] ).
cnf(370,plain,
is_a_theorem(implies(A,implies(B,B))),
inference(hyper,[status(thm)],[99,1,4]),
[iquote('hyper,99,1,4')] ).
cnf(412,plain,
is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))),
inference(hyper,[status(thm)],[370,1,16]),
[iquote('hyper,370,1,16')] ).
cnf(456,plain,
is_a_theorem(implies(A,implies(implies(not(B),B),B))),
inference(hyper,[status(thm)],[412,1,4]),
[iquote('hyper,412,1,4')] ).
cnf(538,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
inference(hyper,[status(thm)],[456,1,16]),
[iquote('hyper,456,1,16')] ).
cnf(1308,plain,
is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))),
inference(hyper,[status(thm)],[538,1,538]),
[iquote('hyper,538,1,538')] ).
cnf(1315,plain,
is_a_theorem(implies(A,implies(B,implies(C,A)))),
inference(hyper,[status(thm)],[538,1,85]),
[iquote('hyper,538,1,85')] ).
cnf(1341,plain,
is_a_theorem(implies(A,implies(B,implies(C,B)))),
inference(hyper,[status(thm)],[1315,1,538]),
[iquote('hyper,1315,1,538')] ).
cnf(1423,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(hyper,[status(thm)],[1341,1,30]),
[iquote('hyper,1341,1,30')] ).
cnf(1431,plain,
is_a_theorem(implies(implies(implies(A,implies(B,A)),C),implies(D,C))),
inference(hyper,[status(thm)],[1341,1,3]),
[iquote('hyper,1341,1,3')] ).
cnf(2315,plain,
is_a_theorem(implies(A,implies(implies(implies(B,implies(C,B)),D),D))),
inference(hyper,[status(thm)],[1431,1,538]),
[iquote('hyper,1431,1,538')] ).
cnf(2406,plain,
is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)),
inference(hyper,[status(thm)],[2315,1,2315]),
[iquote('hyper,2315,1,2315')] ).
cnf(2420,plain,
is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))),
inference(hyper,[status(thm)],[1308,1,2406]),
[iquote('hyper,1308,1,2406')] ).
cnf(2423,plain,
is_a_theorem(implies(implies(not(A),implies(not(A),A)),A)),
inference(hyper,[status(thm)],[2420,1,2420]),
[iquote('hyper,2420,1,2420')] ).
cnf(2444,plain,
is_a_theorem(implies(implies(not(A),not(not(A))),A)),
inference(hyper,[status(thm)],[70,1,2423]),
[iquote('hyper,70,1,2423')] ).
cnf(2458,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(hyper,[status(thm)],[2444,1,1423]),
[iquote('hyper,2444,1,1423')] ).
cnf(2493,plain,
is_a_theorem(implies(implies(implies(not(not(A)),B),C),implies(implies(A,B),C))),
inference(hyper,[status(thm)],[2458,1,20]),
[iquote('hyper,2458,1,20')] ).
cnf(2494,plain,
$false,
inference(binary,[status(thm)],[2493,2]),
[iquote('binary,2493.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL381-1 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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:05 EDT 2022
% 0.19/0.33 % CPUTime :
% 1.75/1.95 ----- Otter 3.3f, August 2004 -----
% 1.75/1.95 The process was started by sandbox on n005.cluster.edu,
% 1.75/1.95 Wed Jul 27 09:20:05 2022
% 1.75/1.95 The command was "./otter". The process ID is 10618.
% 1.75/1.95
% 1.75/1.95 set(prolog_style_variables).
% 1.75/1.95 set(auto).
% 1.75/1.95 dependent: set(auto1).
% 1.75/1.95 dependent: set(process_input).
% 1.75/1.95 dependent: clear(print_kept).
% 1.75/1.95 dependent: clear(print_new_demod).
% 1.75/1.95 dependent: clear(print_back_demod).
% 1.75/1.95 dependent: clear(print_back_sub).
% 1.75/1.95 dependent: set(control_memory).
% 1.75/1.95 dependent: assign(max_mem, 12000).
% 1.75/1.95 dependent: assign(pick_given_ratio, 4).
% 1.75/1.95 dependent: assign(stats_level, 1).
% 1.75/1.95 dependent: assign(max_seconds, 10800).
% 1.75/1.95 clear(print_given).
% 1.75/1.95
% 1.75/1.95 list(usable).
% 1.75/1.95 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.75/1.95 0 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 1.75/1.95 0 [] is_a_theorem(implies(implies(not(X),X),X)).
% 1.75/1.95 0 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 1.75/1.95 0 [] -is_a_theorem(implies(implies(implies(not(not(x)),y),z),implies(implies(x,y),z))).
% 1.75/1.95 end_of_list.
% 1.75/1.95
% 1.75/1.95 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.75/1.95
% 1.75/1.95 This is a Horn set without equality. The strategy will
% 1.75/1.95 be hyperresolution, with satellites in sos and nuclei
% 1.75/1.95 in usable.
% 1.75/1.95
% 1.75/1.95 dependent: set(hyper_res).
% 1.75/1.95 dependent: clear(order_hyper).
% 1.75/1.95
% 1.75/1.95 ------------> process usable:
% 1.75/1.95 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.75/1.95 ** KEPT (pick-wt=14): 2 [] -is_a_theorem(implies(implies(implies(not(not(x)),y),z),implies(implies(x,y),z))).
% 1.75/1.95
% 1.75/1.95 ------------> process sos:
% 1.75/1.95 ** KEPT (pick-wt=12): 3 [] is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 1.75/1.95 ** KEPT (pick-wt=7): 4 [] is_a_theorem(implies(implies(not(A),A),A)).
% 1.75/1.95 ** KEPT (pick-wt=7): 5 [] is_a_theorem(implies(A,implies(not(A),B))).
% 1.75/1.95
% 1.75/1.95 ======= end of input processing =======
% 1.75/1.95
% 1.75/1.95 =========== start of search ===========
% 1.75/1.95
% 1.75/1.95
% 1.75/1.95 Resetting weight limit to 14.
% 1.75/1.95
% 1.75/1.95
% 1.75/1.95 Resetting weight limit to 14.
% 1.75/1.95
% 1.75/1.95 sos_size=2074
% 1.75/1.95
% 1.75/1.95 -------- PROOF --------
% 1.75/1.95
% 1.75/1.95 ----> UNIT CONFLICT at 0.09 sec ----> 2494 [binary,2493.1,2.1] $F.
% 1.75/1.95
% 1.75/1.95 Length of proof is 30. Level of proof is 19.
% 1.75/1.95
% 1.75/1.95 ---------------- PROOF ----------------
% 1.75/1.95 % SZS status Unsatisfiable
% 1.75/1.95 % SZS output start Refutation
% See solution above
% 1.75/1.95 ------------ end of proof -------------
% 1.75/1.95
% 1.75/1.95
% 1.75/1.95 Search stopped by max_proofs option.
% 1.75/1.95
% 1.75/1.95
% 1.75/1.95 Search stopped by max_proofs option.
% 1.75/1.95
% 1.75/1.95 ============ end of search ============
% 1.75/1.95
% 1.75/1.95 -------------- statistics -------------
% 1.75/1.95 clauses given 203
% 1.75/1.95 clauses generated 23050
% 1.75/1.95 clauses kept 2493
% 1.75/1.95 clauses forward subsumed 15833
% 1.75/1.95 clauses back subsumed 78
% 1.75/1.95 Kbytes malloced 4882
% 1.75/1.95
% 1.75/1.95 ----------- times (seconds) -----------
% 1.75/1.95 user CPU time 0.09 (0 hr, 0 min, 0 sec)
% 1.75/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.95 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.75/1.95
% 1.75/1.95 That finishes the proof of the theorem.
% 1.75/1.95
% 1.75/1.95 Process 10618 finished Wed Jul 27 09:20:07 2022
% 1.75/1.95 Otter interrupted
% 1.75/1.95 PROOF FOUND
%------------------------------------------------------------------------------