TSTP Solution File: LCL105-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL105-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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 37.20s 37.40s
% Output : Refutation 37.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 38 ( 37 unt; 0 nHn; 3 RR)
% Number of literals : 40 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 143 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL105-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e_quivalent(b,c)),e),e)),
file('LCL105-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('LCL105-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B)))),
file('LCL105-1.p',unknown),
[] ).
cnf(5,axiom,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,A),C)),C)),
file('LCL105-1.p',unknown),
[] ).
cnf(7,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(e_quivalent(D,B),e_quivalent(D,C))))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(9,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,e_quivalent(e_quivalent(C,D),e_quivalent(e_quivalent(D,C),B))))),
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(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),D))),e_quivalent(A,D))),
inference(hyper,[status(thm)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(53,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(C,D)),e_quivalent(B,e_quivalent(e_quivalent(D,C),A))))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(96,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C))),
inference(hyper,[status(thm)],[10,1,7]),
[iquote('hyper,10,1,7')] ).
cnf(106,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(e_quivalent(C,B),D))),D)),
inference(hyper,[status(thm)],[96,1,10]),
[iquote('hyper,96,1,10')] ).
cnf(109,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(e_quivalent(D,B),e_quivalent(D,C)))),
inference(hyper,[status(thm)],[96,1,7]),
[iquote('hyper,96,1,7')] ).
cnf(111,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(B,D))),e_quivalent(A,e_quivalent(C,D)))),
inference(hyper,[status(thm)],[96,1,4]),
[iquote('hyper,96,1,4')] ).
cnf(466,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,D),e_quivalent(e_quivalent(B,e_quivalent(D,C)),A))))),
inference(hyper,[status(thm)],[53,1,96]),
[iquote('hyper,53,1,96')] ).
cnf(668,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(A,e_quivalent(C,B)),D))),D)),
inference(hyper,[status(thm)],[106,1,96]),
[iquote('hyper,106,1,96')] ).
cnf(720,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,D),e_quivalent(e_quivalent(B,e_quivalent(D,C)),E)))),e_quivalent(A,E))),
inference(hyper,[status(thm)],[109,1,106]),
[iquote('hyper,109,1,106')] ).
cnf(724,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,D))),e_quivalent(B,D))),
inference(hyper,[status(thm)],[111,1,111]),
[iquote('hyper,111,1,111')] ).
cnf(744,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(B,D))),e_quivalent(C,D))),
inference(hyper,[status(thm)],[111,1,96]),
[iquote('hyper,111,1,96')] ).
cnf(749,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),D),e_quivalent(C,e_quivalent(e_quivalent(B,A),D)))),
inference(hyper,[status(thm)],[111,1,9]),
[iquote('hyper,111,1,9')] ).
cnf(750,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(B,D)),e_quivalent(C,e_quivalent(A,D)))),
inference(hyper,[status(thm)],[111,1,7]),
[iquote('hyper,111,1,7')] ).
cnf(1737,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,e_quivalent(B,A)),e_quivalent(e_quivalent(D,C),e_quivalent(D,E)))),E)),
inference(hyper,[status(thm)],[724,1,668]),
[iquote('hyper,724,1,668')] ).
cnf(1848,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(B,D))),e_quivalent(e_quivalent(E,C),e_quivalent(E,D)))),
inference(hyper,[status(thm)],[744,1,7]),
[iquote('hyper,744,1,7')] ).
cnf(1850,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(C,D)),e_quivalent(B,e_quivalent(C,E)))),e_quivalent(A,e_quivalent(D,E)))),
inference(hyper,[status(thm)],[744,1,4]),
[iquote('hyper,744,1,4')] ).
cnf(1927,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),D),E)),e_quivalent(A,e_quivalent(D,e_quivalent(e_quivalent(C,B),E))))),
inference(hyper,[status(thm)],[749,1,4]),
[iquote('hyper,749,1,4')] ).
cnf(1931,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(e_quivalent(B,D),A),e_quivalent(D,C)))),
inference(hyper,[status(thm)],[749,1,744]),
[iquote('hyper,749,1,744')] ).
cnf(2079,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,D),e_quivalent(e_quivalent(E,e_quivalent(D,C)),e_quivalent(e_quivalent(B,E),A)))))),
inference(hyper,[status(thm)],[750,1,466]),
[iquote('hyper,750,1,466')] ).
cnf(6151,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),D)),e_quivalent(e_quivalent(e_quivalent(C,B),A),E)),e_quivalent(D,E))),
inference(hyper,[status(thm)],[1927,1,1850]),
[iquote('hyper,1927,1,1850')] ).
cnf(6167,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,B),A))),
inference(hyper,[status(thm)],[2079,1,720]),
[iquote('hyper,2079,1,720')] ).
cnf(6184,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,A),B),C),e_quivalent(B,C))),
inference(hyper,[status(thm)],[6167,1,1931]),
[iquote('hyper,6167,1,1931')] ).
cnf(6214,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(B,e_quivalent(C,C)),A)))),
inference(hyper,[status(thm)],[6167,1,750]),
[iquote('hyper,6167,1,750')] ).
cnf(6568,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,B)),e_quivalent(e_quivalent(C,A),e_quivalent(C,D))),D)),
inference(hyper,[status(thm)],[6184,1,1737]),
[iquote('hyper,6184,1,1737')] ).
cnf(6767,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(B,e_quivalent(e_quivalent(A,e_quivalent(D,D)),C)))),
inference(hyper,[status(thm)],[6214,1,1931]),
[iquote('hyper,6214,1,1931')] ).
cnf(8447,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,e_quivalent(D,D)),e_quivalent(e_quivalent(B,C),E)))),e_quivalent(A,E))),
inference(hyper,[status(thm)],[6568,1,1848]),
[iquote('hyper,6568,1,1848')] ).
cnf(8875,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),D)),e_quivalent(B,e_quivalent(e_quivalent(C,e_quivalent(E,E)),D)))),
inference(hyper,[status(thm)],[6767,1,1931]),
[iquote('hyper,6767,1,1931')] ).
cnf(12030,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(e_quivalent(B,C),D))),D)),
inference(hyper,[status(thm)],[8875,1,8447]),
[iquote('hyper,8875,1,8447')] ).
cnf(12053,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(C,B),e_quivalent(C,A)),D)),D)),
inference(hyper,[status(thm)],[12030,1,6151]),
[iquote('hyper,12030,1,6151')] ).
cnf(12089,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),D),D)),
inference(hyper,[status(thm)],[12053,1,6151]),
[iquote('hyper,12053,1,6151')] ).
cnf(12090,plain,
$false,
inference(binary,[status(thm)],[12089,2]),
[iquote('binary,12089.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL105-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n018.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:25:46 EDT 2022
% 0.13/0.33 % CPUTime :
% 37.20/37.40 ----- Otter 3.3f, August 2004 -----
% 37.20/37.40 The process was started by sandbox2 on n018.cluster.edu,
% 37.20/37.40 Wed Jul 27 09:25:46 2022
% 37.20/37.40 The command was "./otter". The process ID is 27643.
% 37.20/37.40
% 37.20/37.40 set(prolog_style_variables).
% 37.20/37.40 set(auto).
% 37.20/37.40 dependent: set(auto1).
% 37.20/37.40 dependent: set(process_input).
% 37.20/37.40 dependent: clear(print_kept).
% 37.20/37.40 dependent: clear(print_new_demod).
% 37.20/37.40 dependent: clear(print_back_demod).
% 37.20/37.40 dependent: clear(print_back_sub).
% 37.20/37.40 dependent: set(control_memory).
% 37.20/37.40 dependent: assign(max_mem, 12000).
% 37.20/37.40 dependent: assign(pick_given_ratio, 4).
% 37.20/37.40 dependent: assign(stats_level, 1).
% 37.20/37.40 dependent: assign(max_seconds, 10800).
% 37.20/37.40 clear(print_given).
% 37.20/37.40
% 37.20/37.40 list(usable).
% 37.20/37.40 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 37.20/37.40 0 [] is_a_theorem(e_quivalent(X,e_quivalent(e_quivalent(Y,Z),e_quivalent(e_quivalent(Z,Y),X)))).
% 37.20/37.40 0 [] is_a_theorem(e_quivalent(e_quivalent(X,Y),e_quivalent(e_quivalent(Z,X),e_quivalent(Z,Y)))).
% 37.20/37.40 0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(X,Y),e_quivalent(e_quivalent(Y,X),Z)),Z)).
% 37.20/37.40 0 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e_quivalent(b,c)),e),e)).
% 37.20/37.40 end_of_list.
% 37.20/37.40
% 37.20/37.40 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 37.20/37.40
% 37.20/37.40 This is a Horn set without equality. The strategy will
% 37.20/37.40 be hyperresolution, with satellites in sos and nuclei
% 37.20/37.40 in usable.
% 37.20/37.40
% 37.20/37.40 dependent: set(hyper_res).
% 37.20/37.40 dependent: clear(order_hyper).
% 37.20/37.40
% 37.20/37.40 ------------> process usable:
% 37.20/37.40 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 37.20/37.40 ** KEPT (pick-wt=16): 2 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e_quivalent(b,c)),e),e)).
% 37.20/37.40
% 37.20/37.40 ------------> process sos:
% 37.20/37.40 ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))).
% 37.20/37.40 ** KEPT (pick-wt=12): 4 [] is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B)))).
% 37.20/37.40 ** KEPT (pick-wt=12): 5 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,A),C)),C)).
% 37.20/37.40
% 37.20/37.40 ======= end of input processing =======
% 37.20/37.40
% 37.20/37.40 =========== start of search ===========
% 37.20/37.40
% 37.20/37.40
% 37.20/37.40 Resetting weight limit to 20.
% 37.20/37.40
% 37.20/37.40
% 37.20/37.40 Resetting weight limit to 20.
% 37.20/37.40
% 37.20/37.40 sos_size=5758
% 37.20/37.40
% 37.20/37.40 -- HEY sandbox2, WE HAVE A PROOF!! --
% 37.20/37.40
% 37.20/37.40 ----> UNIT CONFLICT at 35.54 sec ----> 12090 [binary,12089.1,2.1] $F.
% 37.20/37.40
% 37.20/37.40 Length of proof is 32. Level of proof is 12.
% 37.20/37.40
% 37.20/37.40 ---------------- PROOF ----------------
% 37.20/37.40 % SZS status Unsatisfiable
% 37.20/37.40 % SZS output start Refutation
% See solution above
% 37.20/37.40 ------------ end of proof -------------
% 37.20/37.40
% 37.20/37.40
% 37.20/37.40 Search stopped by max_proofs option.
% 37.20/37.40
% 37.20/37.40
% 37.20/37.40 Search stopped by max_proofs option.
% 37.20/37.40
% 37.20/37.40 ============ end of search ============
% 37.20/37.40
% 37.20/37.40 -------------- statistics -------------
% 37.20/37.40 clauses given 4408
% 37.20/37.40 clauses generated 10578801
% 37.20/37.40 clauses kept 12089
% 37.20/37.40 clauses forward subsumed 3657185
% 37.20/37.40 clauses back subsumed 752
% 37.20/37.40 Kbytes malloced 7812
% 37.20/37.40
% 37.20/37.40 ----------- times (seconds) -----------
% 37.20/37.41 user CPU time 35.54 (0 hr, 0 min, 35 sec)
% 37.20/37.41 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 37.20/37.41 wall-clock time 37 (0 hr, 0 min, 37 sec)
% 37.20/37.41
% 37.20/37.41 That finishes the proof of the theorem.
% 37.20/37.41
% 37.20/37.41 Process 27643 finished Wed Jul 27 09:26:23 2022
% 37.20/37.41 Otter interrupted
% 37.20/37.41 PROOF FOUND
%------------------------------------------------------------------------------