TSTP Solution File: LCL083-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL083-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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 1.75s 1.96s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 20 ( 19 unt; 0 nHn; 3 RR)
% Number of literals : 22 ( 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; 2 con; 0-2 aty)
% Number of variables : 60 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL083-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('LCL083-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))),
file('LCL083-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(6,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(E,B))),implies(F,implies(implies(D,B),implies(E,B))))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(7,plain,
is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))),
inference(hyper,[status(thm)],[5,1,5]),
[iquote('hyper,5,1,5')] ).
cnf(9,plain,
is_a_theorem(implies(implies(implies(A,implies(B,A)),B),implies(C,B))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(19,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,C)))),
inference(hyper,[status(thm)],[6,1,9]),
[iquote('hyper,6,1,9')] ).
cnf(21,plain,
is_a_theorem(implies(implies(A,B),implies(B,B))),
inference(hyper,[status(thm)],[19,1,19]),
[iquote('hyper,19,1,19')] ).
cnf(25,plain,
is_a_theorem(implies(implies(A,B),implies(A,B))),
inference(hyper,[status(thm)],[21,1,9]),
[iquote('hyper,21,1,9')] ).
cnf(27,plain,
is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))),
inference(hyper,[status(thm)],[25,1,3]),
[iquote('hyper,25,1,3')] ).
cnf(50,plain,
is_a_theorem(implies(implies(implies(A,B),implies(B,C)),implies(D,implies(B,C)))),
inference(hyper,[status(thm)],[27,1,3]),
[iquote('hyper,27,1,3')] ).
cnf(95,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(D,B)),implies(E,implies(D,B)))),
inference(hyper,[status(thm)],[50,1,3]),
[iquote('hyper,50,1,3')] ).
cnf(467,plain,
is_a_theorem(implies(A,implies(implies(implies(implies(B,C),D),C),implies(B,C)))),
inference(hyper,[status(thm)],[95,1,3]),
[iquote('hyper,95,1,3')] ).
cnf(468,plain,
is_a_theorem(implies(implies(implies(implies(A,B),C),B),implies(A,B))),
inference(hyper,[status(thm)],[467,1,467]),
[iquote('hyper,467,1,467')] ).
cnf(479,plain,
is_a_theorem(implies(implies(implies(A,B),implies(implies(A,B),C)),implies(D,implies(implies(A,B),C)))),
inference(hyper,[status(thm)],[468,1,3]),
[iquote('hyper,468,1,3')] ).
cnf(1150,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
inference(hyper,[status(thm)],[479,1,27]),
[iquote('hyper,479,1,27')] ).
cnf(1155,plain,
is_a_theorem(implies(implies(implies(A,B),A),A)),
inference(hyper,[status(thm)],[1150,1,1150]),
[iquote('hyper,1150,1,1150')] ).
cnf(1156,plain,
$false,
inference(binary,[status(thm)],[1155,2]),
[iquote('binary,1155.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL083-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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 08:45:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.75/1.96 ----- Otter 3.3f, August 2004 -----
% 1.75/1.96 The process was started by sandbox on n017.cluster.edu,
% 1.75/1.96 Wed Jul 27 08:45:18 2022
% 1.75/1.96 The command was "./otter". The process ID is 17842.
% 1.75/1.96
% 1.75/1.96 set(prolog_style_variables).
% 1.75/1.96 set(auto).
% 1.75/1.96 dependent: set(auto1).
% 1.75/1.96 dependent: set(process_input).
% 1.75/1.96 dependent: clear(print_kept).
% 1.75/1.96 dependent: clear(print_new_demod).
% 1.75/1.96 dependent: clear(print_back_demod).
% 1.75/1.96 dependent: clear(print_back_sub).
% 1.75/1.96 dependent: set(control_memory).
% 1.75/1.96 dependent: assign(max_mem, 12000).
% 1.75/1.96 dependent: assign(pick_given_ratio, 4).
% 1.75/1.96 dependent: assign(stats_level, 1).
% 1.75/1.96 dependent: assign(max_seconds, 10800).
% 1.75/1.96 clear(print_given).
% 1.75/1.96
% 1.75/1.96 list(usable).
% 1.75/1.96 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.75/1.96 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),implies(U,X)))).
% 1.75/1.96 0 [] -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 1.75/1.96 end_of_list.
% 1.75/1.96
% 1.75/1.96 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.75/1.96
% 1.75/1.96 This is a Horn set without equality. The strategy will
% 1.75/1.96 be hyperresolution, with satellites in sos and nuclei
% 1.75/1.96 in usable.
% 1.75/1.96
% 1.75/1.96 dependent: set(hyper_res).
% 1.75/1.96 dependent: clear(order_hyper).
% 1.75/1.96
% 1.75/1.96 ------------> process usable:
% 1.75/1.96 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.75/1.96 ** KEPT (pick-wt=8): 2 [] -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 1.75/1.96
% 1.75/1.96 ------------> process sos:
% 1.75/1.96 ** KEPT (pick-wt=14): 3 [] is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))).
% 1.75/1.96
% 1.75/1.96 ======= end of input processing =======
% 1.75/1.96
% 1.75/1.96 =========== start of search ===========
% 1.75/1.96
% 1.75/1.96 -------- PROOF --------
% 1.75/1.96
% 1.75/1.96 ----> UNIT CONFLICT at 0.09 sec ----> 1156 [binary,1155.1,2.1] $F.
% 1.75/1.96
% 1.75/1.96 Length of proof is 16. Level of proof is 15.
% 1.75/1.96
% 1.75/1.96 ---------------- PROOF ----------------
% 1.75/1.96 % SZS status Unsatisfiable
% 1.75/1.96 % SZS output start Refutation
% See solution above
% 1.75/1.96 ------------ end of proof -------------
% 1.75/1.96
% 1.75/1.96
% 1.75/1.96 Search stopped by max_proofs option.
% 1.75/1.96
% 1.75/1.96
% 1.75/1.96 Search stopped by max_proofs option.
% 1.75/1.96
% 1.75/1.96 ============ end of search ============
% 1.75/1.96
% 1.75/1.96 -------------- statistics -------------
% 1.75/1.96 clauses given 164
% 1.75/1.96 clauses generated 21444
% 1.75/1.96 clauses kept 1155
% 1.75/1.96 clauses forward subsumed 20292
% 1.75/1.96 clauses back subsumed 179
% 1.75/1.96 Kbytes malloced 1953
% 1.75/1.96
% 1.75/1.96 ----------- times (seconds) -----------
% 1.75/1.96 user CPU time 0.09 (0 hr, 0 min, 0 sec)
% 1.75/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.96 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.75/1.96
% 1.75/1.96 That finishes the proof of the theorem.
% 1.75/1.96
% 1.75/1.96 Process 17842 finished Wed Jul 27 08:45:19 2022
% 1.75/1.96 Otter interrupted
% 1.75/1.96 PROOF FOUND
%------------------------------------------------------------------------------