TSTP Solution File: LCL022-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL022-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:20 EDT 2022
% Result : Unsatisfiable 1.99s 2.13s
% Output : Refutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of clauses : 14 ( 13 unt; 0 nHn; 3 RR)
% Number of literals : 16 ( 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; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL022-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('LCL022-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,B),e_quivalent(A,C)))),
file('LCL022-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(D,B))),e_quivalent(e_quivalent(D,C),A))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(e_quivalent(D,B),e_quivalent(C,D))))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(7,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,B))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(8,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(B,C),A))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(10,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(C,B)))),
inference(hyper,[status(thm)],[8,1,4]),
[iquote('hyper,8,1,4')] ).
cnf(27,plain,
is_a_theorem(e_quivalent(e_quivalent(A,A),e_quivalent(B,B))),
inference(hyper,[status(thm)],[10,1,4]),
[iquote('hyper,10,1,4')] ).
cnf(33,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[27,1,27]),
[iquote('hyper,27,1,27')] ).
cnf(37,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(B,A))),
inference(hyper,[status(thm)],[33,1,10]),
[iquote('hyper,33,1,10')] ).
cnf(38,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(B,C)))),
inference(hyper,[status(thm)],[33,1,5]),
[iquote('hyper,33,1,5')] ).
cnf(420,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,A)),e_quivalent(B,C))),
inference(hyper,[status(thm)],[38,1,37]),
[iquote('hyper,38,1,37')] ).
cnf(421,plain,
$false,
inference(binary,[status(thm)],[420,2]),
[iquote('binary,420.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n006.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:27:16 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.99/2.13 ----- Otter 3.3f, August 2004 -----
% 1.99/2.13 The process was started by sandbox on n006.cluster.edu,
% 1.99/2.13 Wed Jul 27 09:27:17 2022
% 1.99/2.13 The command was "./otter". The process ID is 24949.
% 1.99/2.13
% 1.99/2.13 set(prolog_style_variables).
% 1.99/2.13 set(auto).
% 1.99/2.13 dependent: set(auto1).
% 1.99/2.13 dependent: set(process_input).
% 1.99/2.13 dependent: clear(print_kept).
% 1.99/2.13 dependent: clear(print_new_demod).
% 1.99/2.13 dependent: clear(print_back_demod).
% 1.99/2.13 dependent: clear(print_back_sub).
% 1.99/2.13 dependent: set(control_memory).
% 1.99/2.13 dependent: assign(max_mem, 12000).
% 1.99/2.13 dependent: assign(pick_given_ratio, 4).
% 1.99/2.13 dependent: assign(stats_level, 1).
% 1.99/2.13 dependent: assign(max_seconds, 10800).
% 1.99/2.13 clear(print_given).
% 1.99/2.13
% 1.99/2.13 list(usable).
% 1.99/2.13 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.99/2.13 0 [] is_a_theorem(e_quivalent(e_quivalent(X,Y),e_quivalent(e_quivalent(Z,Y),e_quivalent(X,Z)))).
% 1.99/2.13 0 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(c,a)),e_quivalent(b,c))).
% 1.99/2.13 end_of_list.
% 1.99/2.13
% 1.99/2.13 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.99/2.13
% 1.99/2.13 This is a Horn set without equality. The strategy will
% 1.99/2.13 be hyperresolution, with satellites in sos and nuclei
% 1.99/2.13 in usable.
% 1.99/2.13
% 1.99/2.13 dependent: set(hyper_res).
% 1.99/2.13 dependent: clear(order_hyper).
% 1.99/2.13
% 1.99/2.13 ------------> process usable:
% 1.99/2.13 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.99/2.13 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(c,a)),e_quivalent(b,c))).
% 1.99/2.13
% 1.99/2.13 ------------> process sos:
% 1.99/2.13 ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,B),e_quivalent(A,C)))).
% 1.99/2.13
% 1.99/2.13 ======= end of input processing =======
% 1.99/2.13
% 1.99/2.13 =========== start of search ===========
% 1.99/2.13
% 1.99/2.13 -------- PROOF --------
% 1.99/2.13
% 1.99/2.13 ----> UNIT CONFLICT at 0.01 sec ----> 421 [binary,420.1,2.1] $F.
% 1.99/2.13
% 1.99/2.13 Length of proof is 10. Level of proof is 8.
% 1.99/2.13
% 1.99/2.13 ---------------- PROOF ----------------
% 1.99/2.13 % SZS status Unsatisfiable
% 1.99/2.13 % SZS output start Refutation
% See solution above
% 1.99/2.13 ------------ end of proof -------------
% 1.99/2.13
% 1.99/2.13
% 1.99/2.13 Search stopped by max_proofs option.
% 1.99/2.13
% 1.99/2.13
% 1.99/2.13 Search stopped by max_proofs option.
% 1.99/2.13
% 1.99/2.13 ============ end of search ============
% 1.99/2.13
% 1.99/2.13 -------------- statistics -------------
% 1.99/2.13 clauses given 33
% 1.99/2.13 clauses generated 768
% 1.99/2.13 clauses kept 420
% 1.99/2.13 clauses forward subsumed 351
% 1.99/2.13 clauses back subsumed 10
% 1.99/2.13 Kbytes malloced 976
% 1.99/2.13
% 1.99/2.13 ----------- times (seconds) -----------
% 1.99/2.13 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.99/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.13 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.99/2.13
% 1.99/2.13 That finishes the proof of the theorem.
% 1.99/2.13
% 1.99/2.13 Process 24949 finished Wed Jul 27 09:27:18 2022
% 1.99/2.13 Otter interrupted
% 1.99/2.13 PROOF FOUND
%------------------------------------------------------------------------------