TSTP Solution File: LCL106-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL106-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:33 EDT 2022
% Result : Unsatisfiable 1.75s 1.94s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 8 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL106-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(c,a),e_quivalent(c,b)))),
file('LCL106-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))),
file('LCL106-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C))),
file('LCL106-1.p',unknown),
[] ).
cnf(5,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,A),e_quivalent(C,e_quivalent(e_quivalent(D,E),e_quivalent(e_quivalent(E,D),C)))))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(9,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B))),e_quivalent(D,e_quivalent(e_quivalent(E,F),e_quivalent(e_quivalent(F,E),D))))),
inference(hyper,[status(thm)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(19,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(e_quivalent(D,E),e_quivalent(e_quivalent(E,D),e_quivalent(B,C))))),
inference(hyper,[status(thm)],[9,1,4]),
[iquote('hyper,9,1,4')] ).
cnf(28,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B)))),
inference(hyper,[status(thm)],[19,1,4]),
[iquote('hyper,19,1,4')] ).
cnf(29,plain,
$false,
inference(binary,[status(thm)],[28,2]),
[iquote('binary,28.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL106-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:27:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.75/1.94 ----- Otter 3.3f, August 2004 -----
% 1.75/1.94 The process was started by sandbox2 on n019.cluster.edu,
% 1.75/1.94 Wed Jul 27 09:27:37 2022
% 1.75/1.94 The command was "./otter". The process ID is 29170.
% 1.75/1.94
% 1.75/1.94 set(prolog_style_variables).
% 1.75/1.94 set(auto).
% 1.75/1.94 dependent: set(auto1).
% 1.75/1.94 dependent: set(process_input).
% 1.75/1.94 dependent: clear(print_kept).
% 1.75/1.94 dependent: clear(print_new_demod).
% 1.75/1.94 dependent: clear(print_back_demod).
% 1.75/1.94 dependent: clear(print_back_sub).
% 1.75/1.94 dependent: set(control_memory).
% 1.75/1.94 dependent: assign(max_mem, 12000).
% 1.75/1.94 dependent: assign(pick_given_ratio, 4).
% 1.75/1.94 dependent: assign(stats_level, 1).
% 1.75/1.94 dependent: assign(max_seconds, 10800).
% 1.75/1.94 clear(print_given).
% 1.75/1.94
% 1.75/1.94 list(usable).
% 1.75/1.94 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.75/1.94 0 [] is_a_theorem(e_quivalent(X,e_quivalent(e_quivalent(Y,Z),e_quivalent(e_quivalent(Z,Y),X)))).
% 1.75/1.94 0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(X,Y),e_quivalent(X,Z)),e_quivalent(Y,Z))).
% 1.75/1.94 0 [] -is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(c,a),e_quivalent(c,b)))).
% 1.75/1.94 end_of_list.
% 1.75/1.94
% 1.75/1.94 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.75/1.94
% 1.75/1.94 This is a Horn set without equality. The strategy will
% 1.75/1.94 be hyperresolution, with satellites in sos and nuclei
% 1.75/1.94 in usable.
% 1.75/1.94
% 1.75/1.94 dependent: set(hyper_res).
% 1.75/1.94 dependent: clear(order_hyper).
% 1.75/1.94
% 1.75/1.94 ------------> process usable:
% 1.75/1.94 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.75/1.94 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(c,a),e_quivalent(c,b)))).
% 1.75/1.94
% 1.75/1.94 ------------> process sos:
% 1.75/1.94 ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))).
% 1.75/1.94 ** KEPT (pick-wt=12): 4 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C))).
% 1.75/1.94
% 1.75/1.94 ======= end of input processing =======
% 1.75/1.94
% 1.75/1.94 =========== start of search ===========
% 1.75/1.94
% 1.75/1.94 -------- PROOF --------
% 1.75/1.94
% 1.75/1.94 ----> UNIT CONFLICT at 0.00 sec ----> 29 [binary,28.1,2.1] $F.
% 1.75/1.94
% 1.75/1.94 Length of proof is 4. Level of proof is 4.
% 1.75/1.94
% 1.75/1.94 ---------------- PROOF ----------------
% 1.75/1.94 % SZS status Unsatisfiable
% 1.75/1.94 % SZS output start Refutation
% See solution above
% 1.75/1.94 ------------ end of proof -------------
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Search stopped by max_proofs option.
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Search stopped by max_proofs option.
% 1.75/1.94
% 1.75/1.94 ============ end of search ============
% 1.75/1.94
% 1.75/1.94 -------------- statistics -------------
% 1.75/1.94 clauses given 7
% 1.75/1.94 clauses generated 28
% 1.75/1.94 clauses kept 28
% 1.75/1.94 clauses forward subsumed 4
% 1.75/1.94 clauses back subsumed 0
% 1.75/1.94 Kbytes malloced 976
% 1.75/1.94
% 1.75/1.94 ----------- times (seconds) -----------
% 1.75/1.94 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.94 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.75/1.94
% 1.75/1.94 That finishes the proof of the theorem.
% 1.75/1.94
% 1.75/1.94 Process 29170 finished Wed Jul 27 09:27:38 2022
% 1.75/1.94 Otter interrupted
% 1.75/1.94 PROOF FOUND
%------------------------------------------------------------------------------