TSTP Solution File: LCL100-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL100-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:32 EDT 2022
% Result : Unsatisfiable 151.12s 151.35s
% Output : Refutation 151.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of clauses : 30 ( 29 unt; 0 nHn; 3 RR)
% Number of literals : 32 ( 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 : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 112 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL100-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e),e_quivalent(e_quivalent(b,c),e)),falsehood),falsehood)),
file('LCL100-1.p',unknown),
[] ).
cnf(3,axiom,
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)),
file('LCL100-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,B),e_quivalent(e_quivalent(A,D),C)))),
file('LCL100-1.p',unknown),
[] ).
cnf(5,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(C,D),A),e_quivalent(e_quivalent(E,D),e_quivalent(e_quivalent(C,E),B))))),
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(e_quivalent(B,D),A),e_quivalent(D,C)))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(7,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(C,D),e_quivalent(C,E)),e_quivalent(D,E)),A),B))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(8,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),D),e_quivalent(C,e_quivalent(A,E))),e_quivalent(D,e_quivalent(B,E)))),
inference(hyper,[status(thm)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(10,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)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(11,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,B),E)),e_quivalent(C,e_quivalent(e_quivalent(D,A),E)))),
inference(hyper,[status(thm)],[6,1,4]),
[iquote('hyper,6,1,4')] ).
cnf(12,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(e_quivalent(C,D),e_quivalent(C,E)),e_quivalent(D,E)),e_quivalent(A,F))),e_quivalent(B,F))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(16,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,B),A))),
inference(hyper,[status(thm)],[5,1,10]),
[iquote('hyper,5,1,10')] ).
cnf(33,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),e_quivalent(e_quivalent(D,E),F)),e_quivalent(e_quivalent(G,E),e_quivalent(e_quivalent(D,G),F)))),
inference(hyper,[status(thm)],[7,1,4]),
[iquote('hyper,7,1,4')] ).
cnf(36,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[16,1,10]),
[iquote('hyper,16,1,10')] ).
cnf(38,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,A),B),C),e_quivalent(B,C))),
inference(hyper,[status(thm)],[16,1,6]),
[iquote('hyper,16,1,6')] ).
cnf(50,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B)))),
inference(hyper,[status(thm)],[36,1,4]),
[iquote('hyper,36,1,4')] ).
cnf(67,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),D)),e_quivalent(e_quivalent(C,B),D))),
inference(hyper,[status(thm)],[8,1,3]),
[iquote('hyper,8,1,3')] ).
cnf(77,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))),
inference(hyper,[status(thm)],[38,1,4]),
[iquote('hyper,38,1,4')] ).
cnf(216,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(D,B),e_quivalent(e_quivalent(C,D),A))))),
inference(hyper,[status(thm)],[11,1,77]),
[iquote('hyper,11,1,77')] ).
cnf(344,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,A),B),B)),
inference(hyper,[status(thm)],[12,1,6]),
[iquote('hyper,12,1,6')] ).
cnf(351,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,B),C)),e_quivalent(A,C))),
inference(hyper,[status(thm)],[344,1,50]),
[iquote('hyper,344,1,50')] ).
cnf(1030,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,A),C)),C)),
inference(hyper,[status(thm)],[67,1,351]),
[iquote('hyper,67,1,351')] ).
cnf(1065,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)],[1030,1,50]),
[iquote('hyper,1030,1,50')] ).
cnf(1075,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,D),e_quivalent(e_quivalent(D,C),e_quivalent(A,E)))),e_quivalent(B,E))),
inference(hyper,[status(thm)],[1030,1,6]),
[iquote('hyper,1030,1,6')] ).
cnf(4090,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,D),e_quivalent(e_quivalent(e_quivalent(e_quivalent(D,E),B),e_quivalent(E,C)),A))))),
inference(hyper,[status(thm)],[216,1,8]),
[iquote('hyper,216,1,8')] ).
cnf(7406,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,D),E))),e_quivalent(e_quivalent(e_quivalent(B,e_quivalent(D,C)),A),E))),
inference(hyper,[status(thm)],[1065,1,33]),
[iquote('hyper,1065,1,33')] ).
cnf(10797,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(B,D)),e_quivalent(C,D)),A))),
inference(hyper,[status(thm)],[4090,1,1075]),
[iquote('hyper,4090,1,1075')] ).
cnf(10821,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(B,D)),E),e_quivalent(e_quivalent(E,e_quivalent(C,D)),A)))),
inference(hyper,[status(thm)],[10797,1,11]),
[iquote('hyper,10797,1,11')] ).
cnf(11824,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),D),e_quivalent(e_quivalent(B,C),D)),E),E)),
inference(hyper,[status(thm)],[10821,1,7406]),
[iquote('hyper,10821,1,7406')] ).
cnf(11825,plain,
$false,
inference(binary,[status(thm)],[11824,2]),
[iquote('binary,11824.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL100-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/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:55:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 151.12/151.35 ----- Otter 3.3f, August 2004 -----
% 151.12/151.35 The process was started by sandbox on n017.cluster.edu,
% 151.12/151.35 Wed Jul 27 08:55:03 2022
% 151.12/151.35 The command was "./otter". The process ID is 5064.
% 151.12/151.35
% 151.12/151.35 set(prolog_style_variables).
% 151.12/151.35 set(auto).
% 151.12/151.35 dependent: set(auto1).
% 151.12/151.35 dependent: set(process_input).
% 151.12/151.35 dependent: clear(print_kept).
% 151.12/151.35 dependent: clear(print_new_demod).
% 151.12/151.35 dependent: clear(print_back_demod).
% 151.12/151.35 dependent: clear(print_back_sub).
% 151.12/151.35 dependent: set(control_memory).
% 151.12/151.35 dependent: assign(max_mem, 12000).
% 151.12/151.35 dependent: assign(pick_given_ratio, 4).
% 151.12/151.35 dependent: assign(stats_level, 1).
% 151.12/151.35 dependent: assign(max_seconds, 10800).
% 151.12/151.35 clear(print_given).
% 151.12/151.35
% 151.12/151.35 list(usable).
% 151.12/151.35 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 151.12/151.35 0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(X,Y),e_quivalent(X,Z)),e_quivalent(Y,Z)),U),U)).
% 151.12/151.35 0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(X,Y),Z),e_quivalent(e_quivalent(U,Y),e_quivalent(e_quivalent(X,U),Z)))).
% 151.12/151.35 0 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e),e_quivalent(e_quivalent(b,c),e)),falsehood),falsehood)).
% 151.12/151.35 end_of_list.
% 151.12/151.35
% 151.12/151.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 151.12/151.35
% 151.12/151.35 This is a Horn set without equality. The strategy will
% 151.12/151.35 be hyperresolution, with satellites in sos and nuclei
% 151.12/151.35 in usable.
% 151.12/151.35
% 151.12/151.35 dependent: set(hyper_res).
% 151.12/151.35 dependent: clear(order_hyper).
% 151.12/151.35
% 151.12/151.35 ------------> process usable:
% 151.12/151.35 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 151.12/151.35 ** KEPT (pick-wt=20): 2 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e),e_quivalent(e_quivalent(b,c),e)),falsehood),falsehood)).
% 151.12/151.35
% 151.12/151.35 ------------> process sos:
% 151.12/151.35 ** KEPT (pick-wt=16): 3 [] 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)).
% 151.12/151.35 ** KEPT (pick-wt=16): 4 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,B),e_quivalent(e_quivalent(A,D),C)))).
% 151.12/151.35
% 151.12/151.35 ======= end of input processing =======
% 151.12/151.35
% 151.12/151.35 =========== start of search ===========
% 151.12/151.35
% 151.12/151.35
% 151.12/151.35 Resetting weight limit to 20.
% 151.12/151.35
% 151.12/151.35
% 151.12/151.35 Resetting weight limit to 20.
% 151.12/151.35
% 151.12/151.35 sos_size=5371
% 151.12/151.35
% 151.12/151.35 -- HEY sandbox, WE HAVE A PROOF!! --
% 151.12/151.35
% 151.12/151.35 ----> UNIT CONFLICT at 149.56 sec ----> 11825 [binary,11824.1,2.1] $F.
% 151.12/151.35
% 151.12/151.35 Length of proof is 25. Level of proof is 11.
% 151.12/151.35
% 151.12/151.35 ---------------- PROOF ----------------
% 151.12/151.35 % SZS status Unsatisfiable
% 151.12/151.35 % SZS output start Refutation
% See solution above
% 151.12/151.35 ------------ end of proof -------------
% 151.12/151.35
% 151.12/151.35
% 151.12/151.35 Search stopped by max_proofs option.
% 151.12/151.35
% 151.12/151.35
% 151.12/151.35 Search stopped by max_proofs option.
% 151.12/151.35
% 151.12/151.35 ============ end of search ============
% 151.12/151.35
% 151.12/151.35 -------------- statistics -------------
% 151.12/151.35 clauses given 8335
% 151.12/151.35 clauses generated 45053539
% 151.12/151.35 clauses kept 11824
% 151.12/151.35 clauses forward subsumed 10762971
% 151.12/151.35 clauses back subsumed 2
% 151.12/151.35 Kbytes malloced 8789
% 151.12/151.35
% 151.12/151.35 ----------- times (seconds) -----------
% 151.12/151.35 user CPU time 149.56 (0 hr, 2 min, 29 sec)
% 151.12/151.35 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 151.12/151.35 wall-clock time 151 (0 hr, 2 min, 31 sec)
% 151.12/151.35
% 151.12/151.35 That finishes the proof of the theorem.
% 151.12/151.35
% 151.12/151.35 Process 5064 finished Wed Jul 27 08:57:34 2022
% 151.12/151.35 Otter interrupted
% 151.12/151.35 PROOF FOUND
%------------------------------------------------------------------------------