TSTP Solution File: LCL071-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL071-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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.94s 3.17s
% Output : Refutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of clauses : 46 ( 45 unt; 0 nHn; 3 RR)
% Number of literals : 48 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 111 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL071-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('LCL071-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
file('LCL071-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
file('LCL071-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('LCL071-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(21,plain,
is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[4,1,6]),
[iquote('hyper,4,1,6')] ).
cnf(44,plain,
is_a_theorem(implies(implies(not(A),B),implies(C,implies(implies(D,B),implies(implies(A,D),B))))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,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(49,plain,
is_a_theorem(implies(implies(implies(A,not(B)),C),implies(implies(D,C),implies(implies(B,D),C)))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(162,plain,
is_a_theorem(implies(implies(A,implies(B,implies(C,implies(D,E)))),implies(implies(D,A),implies(B,implies(C,implies(D,E)))))),
inference(hyper,[status(thm)],[48,1,8]),
[iquote('hyper,48,1,8')] ).
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(220,plain,
is_a_theorem(implies(implies(implies(A,B),not(C)),implies(B,implies(C,D)))),
inference(hyper,[status(thm)],[166,1,21]),
[iquote('hyper,166,1,21')] ).
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(301,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(hyper,[status(thm)],[227,1,220]),
[iquote('hyper,227,1,220')] ).
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(352,plain,
is_a_theorem(implies(not(not(A)),implies(implies(B,C),implies(implies(A,B),C)))),
inference(hyper,[status(thm)],[301,1,5]),
[iquote('hyper,301,1,5')] ).
cnf(453,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
inference(hyper,[status(thm)],[336,1,304]),
[iquote('hyper,336,1,304')] ).
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(494,plain,
is_a_theorem(implies(implies(A,implies(A,implies(A,B))),implies(A,B))),
inference(hyper,[status(thm)],[453,1,336]),
[iquote('hyper,453,1,336')] ).
cnf(516,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))),
inference(hyper,[status(thm)],[481,1,453]),
[iquote('hyper,481,1,453')] ).
cnf(655,plain,
is_a_theorem(implies(implies(not(A),B),implies(implies(A,not(A)),B))),
inference(hyper,[status(thm)],[494,1,44]),
[iquote('hyper,494,1,44')] ).
cnf(719,plain,
is_a_theorem(implies(implies(A,implies(B,implies(B,C))),implies(A,implies(B,C)))),
inference(hyper,[status(thm)],[516,1,336]),
[iquote('hyper,516,1,336')] ).
cnf(755,plain,
is_a_theorem(implies(implies(A,not(A)),not(A))),
inference(hyper,[status(thm)],[655,1,304]),
[iquote('hyper,655,1,304')] ).
cnf(770,plain,
is_a_theorem(implies(implies(A,not(B)),implies(implies(B,A),not(B)))),
inference(hyper,[status(thm)],[755,1,49]),
[iquote('hyper,755,1,49')] ).
cnf(819,plain,
is_a_theorem(implies(implies(A,implies(A,not(A))),not(A))),
inference(hyper,[status(thm)],[770,1,755]),
[iquote('hyper,770,1,755')] ).
cnf(836,plain,
is_a_theorem(implies(implies(A,implies(A,not(A))),implies(B,not(A)))),
inference(hyper,[status(thm)],[819,1,481]),
[iquote('hyper,819,1,481')] ).
cnf(997,plain,
is_a_theorem(implies(implies(A,implies(B,implies(B,not(B)))),implies(A,not(B)))),
inference(hyper,[status(thm)],[836,1,336]),
[iquote('hyper,836,1,336')] ).
cnf(2395,plain,
is_a_theorem(implies(not(not(A)),implies(implies(A,A),A))),
inference(hyper,[status(thm)],[719,1,352]),
[iquote('hyper,719,1,352')] ).
cnf(4364,plain,
is_a_theorem(implies(implies(A,not(B)),implies(B,implies(C,implies(A,D))))),
inference(hyper,[status(thm)],[162,1,301]),
[iquote('hyper,162,1,301')] ).
cnf(4394,plain,
is_a_theorem(implies(A,implies(B,implies(not(A),C)))),
inference(hyper,[status(thm)],[4364,1,304]),
[iquote('hyper,4364,1,304')] ).
cnf(4403,plain,
is_a_theorem(implies(A,not(not(A)))),
inference(hyper,[status(thm)],[4394,1,997]),
[iquote('hyper,4394,1,997')] ).
cnf(4474,plain,
is_a_theorem(implies(implies(not(A),A),not(not(A)))),
inference(hyper,[status(thm)],[4403,1,770]),
[iquote('hyper,4403,1,770')] ).
cnf(4652,plain,
is_a_theorem(not(not(implies(A,A)))),
inference(hyper,[status(thm)],[4403,1,304]),
[iquote('hyper,4403,1,304')] ).
cnf(4710,plain,
is_a_theorem(implies(implies(A,B),implies(implies(implies(C,C),A),B))),
inference(hyper,[status(thm)],[4652,1,352]),
[iquote('hyper,4652,1,352')] ).
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(5502,plain,
is_a_theorem(implies(implies(implies(A,A),B),B)),
inference(hyper,[status(thm)],[4710,1,304]),
[iquote('hyper,4710,1,304')] ).
cnf(5556,plain,
is_a_theorem(implies(implies(A,A),implies(not(not(A)),A))),
inference(hyper,[status(thm)],[4735,1,2395]),
[iquote('hyper,4735,1,2395')] ).
cnf(5652,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(hyper,[status(thm)],[5556,1,5502]),
[iquote('hyper,5556,1,5502')] ).
cnf(5671,plain,
is_a_theorem(implies(not(not(A)),implies(B,A))),
inference(hyper,[status(thm)],[5652,1,481]),
[iquote('hyper,5652,1,481')] ).
cnf(5687,plain,
is_a_theorem(implies(implies(A,not(not(B))),implies(A,B))),
inference(hyper,[status(thm)],[5671,1,336]),
[iquote('hyper,5671,1,336')] ).
cnf(5825,plain,
is_a_theorem(implies(implies(not(A),A),A)),
inference(hyper,[status(thm)],[5687,1,4474]),
[iquote('hyper,5687,1,4474')] ).
cnf(5826,plain,
$false,
inference(binary,[status(thm)],[5825,2]),
[iquote('binary,5825.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL071-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 09:10:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.94/3.17 ----- Otter 3.3f, August 2004 -----
% 2.94/3.17 The process was started by sandbox on n004.cluster.edu,
% 2.94/3.17 Wed Jul 27 09:10:21 2022
% 2.94/3.17 The command was "./otter". The process ID is 7291.
% 2.94/3.17
% 2.94/3.17 set(prolog_style_variables).
% 2.94/3.17 set(auto).
% 2.94/3.17 dependent: set(auto1).
% 2.94/3.17 dependent: set(process_input).
% 2.94/3.17 dependent: clear(print_kept).
% 2.94/3.17 dependent: clear(print_new_demod).
% 2.94/3.17 dependent: clear(print_back_demod).
% 2.94/3.17 dependent: clear(print_back_sub).
% 2.94/3.17 dependent: set(control_memory).
% 2.94/3.17 dependent: assign(max_mem, 12000).
% 2.94/3.17 dependent: assign(pick_given_ratio, 4).
% 2.94/3.17 dependent: assign(stats_level, 1).
% 2.94/3.17 dependent: assign(max_seconds, 10800).
% 2.94/3.17 clear(print_given).
% 2.94/3.17
% 2.94/3.17 list(usable).
% 2.94/3.17 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.94/3.17 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 2.94/3.17 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 2.94/3.17 0 [] is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(X,implies(implies(U,Z),implies(implies(Y,U),Z))))).
% 2.94/3.17 0 [] -is_a_theorem(implies(implies(not(a),a),a)).
% 2.94/3.17 end_of_list.
% 2.94/3.17
% 2.94/3.17 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.94/3.17
% 2.94/3.17 This is a Horn set without equality. The strategy will
% 2.94/3.17 be hyperresolution, with satellites in sos and nuclei
% 2.94/3.17 in usable.
% 2.94/3.17
% 2.94/3.17 dependent: set(hyper_res).
% 2.94/3.17 dependent: clear(order_hyper).
% 2.94/3.17
% 2.94/3.17 ------------> process usable:
% 2.94/3.17 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.94/3.17 ** KEPT (pick-wt=7): 2 [] -is_a_theorem(implies(implies(not(a),a),a)).
% 2.94/3.17
% 2.94/3.17 ------------> process sos:
% 2.94/3.17 ** KEPT (pick-wt=10): 3 [] is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 2.94/3.17 ** KEPT (pick-wt=11): 4 [] is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 2.94/3.17 ** 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.94/3.17
% 2.94/3.17 ======= end of input processing =======
% 2.94/3.17
% 2.94/3.17 =========== start of search ===========
% 2.94/3.17
% 2.94/3.17
% 2.94/3.17 Resetting weight limit to 15.
% 2.94/3.17
% 2.94/3.17
% 2.94/3.17 Resetting weight limit to 15.
% 2.94/3.17
% 2.94/3.17 sos_size=3791
% 2.94/3.17
% 2.94/3.17
% 2.94/3.17 Resetting weight limit to 13.
% 2.94/3.17
% 2.94/3.17
% 2.94/3.17 Resetting weight limit to 13.
% 2.94/3.17
% 2.94/3.17 sos_size=4304
% 2.94/3.17
% 2.94/3.17
% 2.94/3.17 Resetting weight limit to 12.
% 2.94/3.17
% 2.94/3.17
% 2.94/3.17 Resetting weight limit to 12.
% 2.94/3.17
% 2.94/3.17 sos_size=4528
% 2.94/3.17
% 2.94/3.17 -------- PROOF --------
% 2.94/3.17
% 2.94/3.17 ----> UNIT CONFLICT at 1.16 sec ----> 5826 [binary,5825.1,2.1] $F.
% 2.94/3.17
% 2.94/3.17 Length of proof is 40. Level of proof is 21.
% 2.94/3.17
% 2.94/3.17 ---------------- PROOF ----------------
% 2.94/3.17 % SZS status Unsatisfiable
% 2.94/3.17 % SZS output start Refutation
% See solution above
% 2.94/3.17 ------------ end of proof -------------
% 2.94/3.17
% 2.94/3.17
% 2.94/3.17 Search stopped by max_proofs option.
% 2.94/3.17
% 2.94/3.17
% 2.94/3.17 Search stopped by max_proofs option.
% 2.94/3.17
% 2.94/3.17 ============ end of search ============
% 2.94/3.17
% 2.94/3.17 -------------- statistics -------------
% 2.94/3.17 clauses given 923
% 2.94/3.17 clauses generated 449389
% 2.94/3.17 clauses kept 5825
% 2.94/3.17 clauses forward subsumed 241017
% 2.94/3.17 clauses back subsumed 152
% 2.94/3.17 Kbytes malloced 6835
% 2.94/3.17
% 2.94/3.17 ----------- times (seconds) -----------
% 2.94/3.17 user CPU time 1.16 (0 hr, 0 min, 1 sec)
% 2.94/3.17 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.94/3.17 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.94/3.17
% 2.94/3.17 That finishes the proof of the theorem.
% 2.94/3.17
% 2.94/3.17 Process 7291 finished Wed Jul 27 09:10:24 2022
% 2.94/3.17 Otter interrupted
% 2.94/3.17 PROOF FOUND
%------------------------------------------------------------------------------