TSTP Solution File: LCL650+1.001 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:04:52 EDT 2022
% Result : Theorem 1.77s 1.96s
% Output : Refutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 16 ( 7 unt; 6 nHn; 16 RR)
% Number of literals : 49 ( 0 equ; 30 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ r1(dollar_c10,A)
| ~ r1(A,B)
| ~ r1(B,C)
| ~ r1(C,D)
| p3(D)
| p1(D) ),
file('LCL650+1.001.p',unknown),
[] ).
cnf(3,axiom,
( ~ r1(dollar_c10,A)
| ~ r1(A,B)
| ~ r1(B,C)
| ~ r1(C,D)
| ~ p1(D)
| ~ p3(D) ),
file('LCL650+1.001.p',unknown),
[] ).
cnf(6,axiom,
( ~ r1(dollar_c10,A)
| ~ r1(A,B)
| ~ r1(B,C)
| ~ r1(C,D)
| p2(D)
| p3(D) ),
file('LCL650+1.001.p',unknown),
[] ).
cnf(7,axiom,
( ~ r1(dollar_c10,A)
| ~ r1(A,B)
| ~ r1(B,C)
| ~ r1(C,D)
| ~ p3(D)
| ~ p2(D) ),
file('LCL650+1.001.p',unknown),
[] ).
cnf(10,axiom,
( ~ r1(dollar_c10,A)
| ~ r1(A,B)
| ~ r1(B,C)
| ~ r1(C,D)
| p1(D)
| p2(D) ),
file('LCL650+1.001.p',unknown),
[] ).
cnf(11,axiom,
( ~ r1(dollar_c10,A)
| ~ r1(A,B)
| ~ r1(B,C)
| ~ r1(C,D)
| ~ p2(D)
| ~ p1(D) ),
file('LCL650+1.001.p',unknown),
[] ).
cnf(75,axiom,
r1(dollar_c10,dollar_c4),
file('LCL650+1.001.p',unknown),
[] ).
cnf(76,axiom,
r1(dollar_c4,dollar_c3),
file('LCL650+1.001.p',unknown),
[] ).
cnf(77,axiom,
r1(dollar_c3,dollar_c2),
file('LCL650+1.001.p',unknown),
[] ).
cnf(78,axiom,
r1(dollar_c2,dollar_c1),
file('LCL650+1.001.p',unknown),
[] ).
cnf(87,plain,
( p1(dollar_c1)
| p2(dollar_c1) ),
inference(hyper,[status(thm)],[78,10,75,76,77]),
[iquote('hyper,78,10,75,76,77')] ).
cnf(88,plain,
( p2(dollar_c1)
| p3(dollar_c1) ),
inference(hyper,[status(thm)],[78,6,75,76,77]),
[iquote('hyper,78,6,75,76,77')] ).
cnf(89,plain,
( p3(dollar_c1)
| p1(dollar_c1) ),
inference(hyper,[status(thm)],[78,2,75,76,77]),
[iquote('hyper,78,2,75,76,77')] ).
cnf(97,plain,
p1(dollar_c1),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[89,7,75,76,77,78,87])]),
[iquote('hyper,89,7,75,76,77,78,87,factor_simp')] ).
cnf(98,plain,
p2(dollar_c1),
inference(hyper,[status(thm)],[97,3,75,76,77,78,88]),
[iquote('hyper,97,3,75,76,77,78,88')] ).
cnf(99,plain,
$false,
inference(hyper,[status(thm)],[98,11,75,76,77,78,97]),
[iquote('hyper,98,11,75,76,77,78,97')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 09:17:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.77/1.96 ----- Otter 3.3f, August 2004 -----
% 1.77/1.96 The process was started by sandbox2 on n009.cluster.edu,
% 1.77/1.96 Wed Jul 27 09:17:06 2022
% 1.77/1.96 The command was "./otter". The process ID is 25712.
% 1.77/1.96
% 1.77/1.96 set(prolog_style_variables).
% 1.77/1.96 set(auto).
% 1.77/1.96 dependent: set(auto1).
% 1.77/1.96 dependent: set(process_input).
% 1.77/1.96 dependent: clear(print_kept).
% 1.77/1.96 dependent: clear(print_new_demod).
% 1.77/1.96 dependent: clear(print_back_demod).
% 1.77/1.96 dependent: clear(print_back_sub).
% 1.77/1.96 dependent: set(control_memory).
% 1.77/1.96 dependent: assign(max_mem, 12000).
% 1.77/1.96 dependent: assign(pick_given_ratio, 4).
% 1.77/1.96 dependent: assign(stats_level, 1).
% 1.77/1.96 dependent: assign(max_seconds, 10800).
% 1.77/1.96 clear(print_given).
% 1.77/1.96
% 1.77/1.96 formula_list(usable).
% 1.77/1.96 -(-(exists X (-((all Y (-r1(X,Y)| (all X (-r1(Y,X)| (all Y (-r1(X,Y)| (all X (-r1(Y,X)| -p8(X)& -p6(X)& -p4(X)& -p2(X)))))))))| (all Y (-r1(X,Y)|p5(Y)))| -(all Y (-r1(X,Y)| -(-(all X (-r1(Y,X)| (all Y (-r1(X,Y)| (all X (-r1(Y,X)| -(-p3(X)& -p1(X)|p1(X)&p3(X))))))))| (all X (-r1(Y,X)|p4(X)))| -(all X (-r1(Y,X)| -(-(all Y (-r1(X,Y)| (all X (-r1(Y,X)| -(-p2(X)& -p3(X)|p3(X)&p2(X))))))| (all Y (-r1(X,Y)|p3(Y)))| -(all Y (-r1(X,Y)| -(-(all X (-r1(Y,X)| -(-p1(X)& -p2(X)|p2(X)&p1(X)))))))))))))| (all Y (-r1(X,Y)| (all X (-r1(Y,X)| (all Y (-r1(X,Y)| (all X (-r1(Y,X)|p4(X)&p3(X)&p2(X)&p1(X))))))))))))).
% 1.77/1.96 end_of_list.
% 1.77/1.96
% 1.77/1.96 -------> usable clausifies to:
% 1.77/1.96
% 1.77/1.96 list(usable).
% 1.77/1.96 0 [] r1($c10,$c4).
% 1.77/1.96 0 [] r1($c4,$c3).
% 1.77/1.96 0 [] r1($c3,$c2).
% 1.77/1.96 0 [] r1($c2,$c1).
% 1.77/1.96 0 [] p8($c1)|p6($c1)|p4($c1)|p2($c1).
% 1.77/1.96 0 [] r1($c10,$c5).
% 1.77/1.96 0 [] -p5($c5).
% 1.77/1.96 0 [] -r1($c10,Y)| -r1(Y,X)| -r1(X,X1)| -r1(X1,X2)|p3(X2)|p1(X2).
% 1.77/1.96 0 [] -r1($c10,Y)| -r1(Y,X)| -r1(X,X1)| -r1(X1,X2)| -p1(X2)| -p3(X2).
% 1.77/1.96 0 [] -r1($c10,Y)|r1(Y,$f1(Y)).
% 1.77/1.96 0 [] -r1($c10,Y)| -p4($f1(Y)).
% 1.77/1.96 0 [] -r1($c10,Y)| -r1(Y,X7)| -r1(X7,X3)| -r1(X3,X4)|p2(X4)|p3(X4).
% 1.77/1.96 0 [] -r1($c10,Y)| -r1(Y,X7)| -r1(X7,X3)| -r1(X3,X4)| -p3(X4)| -p2(X4).
% 1.77/1.96 0 [] -r1($c10,Y)| -r1(Y,X7)|r1(X7,$f2(Y,X7)).
% 1.77/1.96 0 [] -r1($c10,Y)| -r1(Y,X7)| -p3($f2(Y,X7)).
% 1.77/1.96 0 [] -r1($c10,Y)| -r1(Y,X7)| -r1(X7,X5)| -r1(X5,X6)|p1(X6)|p2(X6).
% 1.77/1.96 0 [] -r1($c10,Y)| -r1(Y,X7)| -r1(X7,X5)| -r1(X5,X6)| -p2(X6)| -p1(X6).
% 1.77/1.96 0 [] r1($c10,$c9).
% 1.77/1.96 0 [] r1($c9,$c8).
% 1.77/1.96 0 [] r1($c8,$c7).
% 1.77/1.96 0 [] r1($c7,$c6).
% 1.77/1.96 0 [] -p4($c6)| -p3($c6)| -p2($c6)| -p1($c6).
% 1.77/1.96 end_of_list.
% 1.77/1.96
% 1.77/1.96 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.77/1.96
% 1.77/1.96 This is a non-Horn set without equality. The strategy will
% 1.77/1.96 be ordered hyper_res, unit deletion, and factoring, with
% 1.77/1.96 satellites in sos and with nuclei in usable.
% 1.77/1.96
% 1.77/1.96 dependent: set(hyper_res).
% 1.77/1.96 dependent: set(factor).
% 1.77/1.96 dependent: set(unit_deletion).
% 1.77/1.96
% 1.77/1.96 ------------> process usable:
% 1.77/1.96 ** KEPT (pick-wt=2): 1 [] -p5($c5).
% 1.77/1.96 ** KEPT (pick-wt=16): 2 [] -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)|p3(D)|p1(D).
% 1.77/1.96 ** KEPT (pick-wt=16): 3 [] -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -p1(D)| -p3(D).
% 1.77/1.96 ** KEPT (pick-wt=7): 4 [] -r1($c10,A)|r1(A,$f1(A)).
% 1.77/1.96 ** KEPT (pick-wt=6): 5 [] -r1($c10,A)| -p4($f1(A)).
% 1.77/1.96 ** KEPT (pick-wt=16): 6 [] -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)|p2(D)|p3(D).
% 1.77/1.96 ** KEPT (pick-wt=16): 7 [] -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -p3(D)| -p2(D).
% 1.77/1.96 ** KEPT (pick-wt=11): 8 [] -r1($c10,A)| -r1(A,B)|r1(B,$f2(A,B)).
% 1.77/1.96 ** KEPT (pick-wt=10): 9 [] -r1($c10,A)| -r1(A,B)| -p3($f2(A,B)).
% 1.77/1.96 ** KEPT (pick-wt=16): 10 [] -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)|p1(D)|p2(D).
% 1.77/1.96 ** KEPT (pick-wt=16): 11 [] -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -p2(D)| -p1(D).
% 1.77/1.96 ** KEPT (pick-wt=8): 12 [] -p4($c6)| -p3($c6)| -p2($c6)| -p1($c6).
% 1.77/1.96
% 1.77/1.96 ------------> process sos:
% 1.77/1.96 ** KEPT (pick-wt=3): 75 [] r1($c10,$c4).
% 1.77/1.96 ** KEPT (pick-wt=3): 76 [] r1($c4,$c3).
% 1.77/1.96 ** KEPT (pick-wt=3): 77 [] r1($c3,$c2).
% 1.77/1.96 ** KEPT (pick-wt=3): 78 [] r1($c2,$c1).
% 1.77/1.96 ** KEPT (pick-wt=8): 79 [] p8($c1)|p6($c1)|p4($c1)|p2($c1).
% 1.77/1.96 ** KEPT (pick-wt=3): 80 [] r1($c10,$c5).
% 1.77/1.96 ** KEPT (pick-wt=3): 81 [] r1($c10,$c9).
% 1.77/1.96 ** KEPT (pick-wt=3): 82 [] r1($c9,$c8).
% 1.77/1.96 ** KEPT (pick-wt=3): 83 [] r1($c8,$c7).
% 1.77/1.96 ** KEPT (pick-wt=3): 84 [] r1($c7,$c6).
% 1.77/1.96
% 1.77/1.96 ======= end of input processing =======
% 1.77/1.96
% 1.77/1.96 =========== start of search ===========
% 1.77/1.96
% 1.77/1.96 -------- PROOF --------
% 1.77/1.96
% 1.77/1.96 -----> EMPTY CLAUSE at 0.01 sec ----> 99 [hyper,98,11,75,76,77,78,97] $F.
% 1.77/1.96
% 1.77/1.96 Length of proof is 5. Level of proof is 3.
% 1.77/1.96
% 1.77/1.96 ---------------- PROOF ----------------
% 1.77/1.96 % SZS status Theorem
% 1.77/1.96 % SZS output start Refutation
% See solution above
% 1.77/1.96 ------------ end of proof -------------
% 1.77/1.96
% 1.77/1.96
% 1.77/1.96 Search stopped by max_proofs option.
% 1.77/1.96
% 1.77/1.96
% 1.77/1.96 Search stopped by max_proofs option.
% 1.77/1.96
% 1.77/1.96 ============ end of search ============
% 1.77/1.96
% 1.77/1.96 -------------- statistics -------------
% 1.77/1.96 clauses given 17
% 1.77/1.96 clauses generated 180
% 1.77/1.96 clauses kept 98
% 1.77/1.96 clauses forward subsumed 103
% 1.77/1.96 clauses back subsumed 4
% 1.77/1.96 Kbytes malloced 976
% 1.77/1.96
% 1.77/1.96 ----------- times (seconds) -----------
% 1.77/1.96 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.77/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.77/1.96 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.77/1.96
% 1.77/1.96 That finishes the proof of the theorem.
% 1.77/1.96
% 1.77/1.96 Process 25712 finished Wed Jul 27 09:17:07 2022
% 1.77/1.96 Otter interrupted
% 1.77/1.96 PROOF FOUND
%------------------------------------------------------------------------------