TSTP Solution File: LCL006-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:17 EDT 2022
% Result : Unsatisfiable 4.38s 4.60s
% Output : Refutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% 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 : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL006-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(c,a)),e_quivalent(b,c))),
file('LCL006-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(B,A))),
file('LCL006-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(A,e_quivalent(B,C)))),
file('LCL006-1.p',unknown),
[] ).
cnf(5,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(A,e_quivalent(B,C))))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(6,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(A,B),C))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(7,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(B,A)))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(10,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(A,B)),B)),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(14,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(A,B),B))),
inference(hyper,[status(thm)],[10,1,4]),
[iquote('hyper,10,1,4')] ).
cnf(21,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,A))),e_quivalent(B,C))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(25,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(28,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(e_quivalent(B,C),C),A)))),
inference(hyper,[status(thm)],[14,1,5]),
[iquote('hyper,14,1,5')] ).
cnf(80,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),A),e_quivalent(B,C))),
inference(hyper,[status(thm)],[6,1,4]),
[iquote('hyper,6,1,4')] ).
cnf(507,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(C,B),A))),
inference(hyper,[status(thm)],[25,1,6]),
[iquote('hyper,25,1,6')] ).
cnf(678,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(B,C),C),A))),
inference(hyper,[status(thm)],[28,1,6]),
[iquote('hyper,28,1,6')] ).
cnf(2960,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(C,e_quivalent(e_quivalent(B,C),A))))),
inference(hyper,[status(thm)],[80,1,21]),
[iquote('hyper,80,1,21')] ).
cnf(8548,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(B,e_quivalent(A,C))))),
inference(hyper,[status(thm)],[507,1,21]),
[iquote('hyper,507,1,21')] ).
cnf(8603,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),B),C),e_quivalent(C,A))),
inference(hyper,[status(thm)],[678,1,3]),
[iquote('hyper,678,1,3')] ).
cnf(9544,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(e_quivalent(B,C),A)))),
inference(hyper,[status(thm)],[2960,1,6]),
[iquote('hyper,2960,1,6')] ).
cnf(13840,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(B,e_quivalent(A,C)))),
inference(hyper,[status(thm)],[8548,1,6]),
[iquote('hyper,8548,1,6')] ).
cnf(15970,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,A),e_quivalent(C,B))),C)),
inference(hyper,[status(thm)],[9544,1,8603]),
[iquote('hyper,9544,1,8603')] ).
cnf(23110,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,A)),e_quivalent(B,C))),
inference(hyper,[status(thm)],[15970,1,13840]),
[iquote('hyper,15970,1,13840')] ).
cnf(23111,plain,
$false,
inference(binary,[status(thm)],[23110,2]),
[iquote('binary,23110.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.14/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 09:06:46 EDT 2022
% 0.14/0.35 % CPUTime :
% 4.38/4.60 ----- Otter 3.3f, August 2004 -----
% 4.38/4.60 The process was started by sandbox2 on n007.cluster.edu,
% 4.38/4.60 Wed Jul 27 09:06:46 2022
% 4.38/4.60 The command was "./otter". The process ID is 15002.
% 4.38/4.60
% 4.38/4.60 set(prolog_style_variables).
% 4.38/4.60 set(auto).
% 4.38/4.60 dependent: set(auto1).
% 4.38/4.60 dependent: set(process_input).
% 4.38/4.60 dependent: clear(print_kept).
% 4.38/4.60 dependent: clear(print_new_demod).
% 4.38/4.60 dependent: clear(print_back_demod).
% 4.38/4.60 dependent: clear(print_back_sub).
% 4.38/4.60 dependent: set(control_memory).
% 4.38/4.60 dependent: assign(max_mem, 12000).
% 4.38/4.60 dependent: assign(pick_given_ratio, 4).
% 4.38/4.60 dependent: assign(stats_level, 1).
% 4.38/4.60 dependent: assign(max_seconds, 10800).
% 4.38/4.60 clear(print_given).
% 4.38/4.60
% 4.38/4.60 list(usable).
% 4.38/4.60 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 4.38/4.60 0 [] is_a_theorem(e_quivalent(e_quivalent(X,Y),e_quivalent(Y,X))).
% 4.38/4.60 0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(X,Y),Z),e_quivalent(X,e_quivalent(Y,Z)))).
% 4.38/4.60 0 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(c,a)),e_quivalent(b,c))).
% 4.38/4.60 end_of_list.
% 4.38/4.60
% 4.38/4.60 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 4.38/4.60
% 4.38/4.60 This is a Horn set without equality. The strategy will
% 4.38/4.60 be hyperresolution, with satellites in sos and nuclei
% 4.38/4.60 in usable.
% 4.38/4.60
% 4.38/4.60 dependent: set(hyper_res).
% 4.38/4.60 dependent: clear(order_hyper).
% 4.38/4.60
% 4.38/4.60 ------------> process usable:
% 4.38/4.60 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.38/4.60 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(c,a)),e_quivalent(b,c))).
% 4.38/4.60
% 4.38/4.60 ------------> process sos:
% 4.38/4.60 ** KEPT (pick-wt=8): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(B,A))).
% 4.38/4.60 ** KEPT (pick-wt=12): 4 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(A,e_quivalent(B,C)))).
% 4.38/4.60
% 4.38/4.60 ======= end of input processing =======
% 4.38/4.60
% 4.38/4.60 =========== start of search ===========
% 4.38/4.60
% 4.38/4.60
% 4.38/4.60 Resetting weight limit to 16.
% 4.38/4.60
% 4.38/4.60
% 4.38/4.60 Resetting weight limit to 16.
% 4.38/4.60
% 4.38/4.60 sos_size=7697
% 4.38/4.60
% 4.38/4.60 -------- PROOF --------
% 4.38/4.60
% 4.38/4.60 ----> UNIT CONFLICT at 2.68 sec ----> 23111 [binary,23110.1,2.1] $F.
% 4.38/4.60
% 4.38/4.60 Length of proof is 18. Level of proof is 8.
% 4.38/4.60
% 4.38/4.60 ---------------- PROOF ----------------
% 4.38/4.60 % SZS status Unsatisfiable
% 4.38/4.60 % SZS output start Refutation
% See solution above
% 4.38/4.60 ------------ end of proof -------------
% 4.38/4.60
% 4.38/4.60
% 4.38/4.60 Search stopped by max_proofs option.
% 4.38/4.60
% 4.38/4.60
% 4.38/4.60 Search stopped by max_proofs option.
% 4.38/4.60
% 4.38/4.60 ============ end of search ============
% 4.38/4.60
% 4.38/4.60 -------------- statistics -------------
% 4.38/4.60 clauses given 670
% 4.38/4.60 clauses generated 274031
% 4.38/4.60 clauses kept 23110
% 4.38/4.60 clauses forward subsumed 93622
% 4.38/4.60 clauses back subsumed 0
% 4.38/4.60 Kbytes malloced 9765
% 4.38/4.60
% 4.38/4.60 ----------- times (seconds) -----------
% 4.38/4.60 user CPU time 2.68 (0 hr, 0 min, 2 sec)
% 4.38/4.60 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 4.38/4.60 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 4.38/4.60
% 4.38/4.60 That finishes the proof of the theorem.
% 4.38/4.60
% 4.38/4.60 Process 15002 finished Wed Jul 27 09:06:50 2022
% 4.38/4.60 Otter interrupted
% 4.38/4.60 PROOF FOUND
%------------------------------------------------------------------------------