TSTP Solution File: LCL682+1.001 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:05:08 EDT 2022
% Result : Theorem 1.95s 2.12s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 6 ( 5 unt; 0 nHn; 6 RR)
% Number of literals : 8 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ r1(dollar_c9,A)
| ~ r1(A,B)
| p12(B) ),
file('LCL682+1.001.p',unknown),
[] ).
cnf(7,axiom,
~ p12(dollar_c5),
file('LCL682+1.001.p',unknown),
[] ).
cnf(14,axiom,
r1(dollar_c9,dollar_c6),
file('LCL682+1.001.p',unknown),
[] ).
cnf(15,axiom,
r1(dollar_c6,dollar_c5),
file('LCL682+1.001.p',unknown),
[] ).
cnf(39,plain,
p12(dollar_c5),
inference(hyper,[status(thm)],[15,3,14]),
[iquote('hyper,15,3,14')] ).
cnf(40,plain,
$false,
inference(binary,[status(thm)],[39,7]),
[iquote('binary,39.1,7.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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 09:29:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.95/2.12 ----- Otter 3.3f, August 2004 -----
% 1.95/2.12 The process was started by sandbox2 on n026.cluster.edu,
% 1.95/2.12 Wed Jul 27 09:29:54 2022
% 1.95/2.12 The command was "./otter". The process ID is 9156.
% 1.95/2.12
% 1.95/2.12 set(prolog_style_variables).
% 1.95/2.12 set(auto).
% 1.95/2.12 dependent: set(auto1).
% 1.95/2.12 dependent: set(process_input).
% 1.95/2.12 dependent: clear(print_kept).
% 1.95/2.12 dependent: clear(print_new_demod).
% 1.95/2.12 dependent: clear(print_back_demod).
% 1.95/2.12 dependent: clear(print_back_sub).
% 1.95/2.12 dependent: set(control_memory).
% 1.95/2.12 dependent: assign(max_mem, 12000).
% 1.95/2.12 dependent: assign(pick_given_ratio, 4).
% 1.95/2.12 dependent: assign(stats_level, 1).
% 1.95/2.12 dependent: assign(max_seconds, 10800).
% 1.95/2.12 clear(print_given).
% 1.95/2.12
% 1.95/2.12 formula_list(usable).
% 1.95/2.12 all X r1(X,X).
% 1.95/2.12 all X Y Z (r1(X,Y)&r1(Y,Z)->r1(X,Z)).
% 1.95/2.12 -(-(exists X (-(-(all Y (-r1(X,Y)| -(-(all X (-r1(Y,X)|p16(X)))| -(all X (-r1(Y,X)|p12(X)))| -(all X (-r1(Y,X)|p14(X)))| -(all X (-r1(Y,X)|p12(X))))))| (all Y (-r1(X,Y)| (all X (-r1(Y,X)|p15(X)))))| (all Y (-r1(X,Y)| (all X (-r1(Y,X)|p13(X)))))| (all Y (-r1(X,Y)| (all X (-r1(Y,X)|p12(X)))))| (all Y (-r1(X,Y)| (all X (-r1(Y,X)|p11(X))))))))).
% 1.95/2.12 end_of_list.
% 1.95/2.12
% 1.95/2.12 -------> usable clausifies to:
% 1.95/2.12
% 1.95/2.12 list(usable).
% 1.95/2.12 0 [] r1(X,X).
% 1.95/2.12 0 [] -r1(X,Y)| -r1(Y,Z)|r1(X,Z).
% 1.95/2.12 0 [] -r1($c9,Y)| -r1(Y,X)|p16(X).
% 1.95/2.12 0 [] -r1($c9,Y)| -r1(Y,X1)|p12(X1).
% 1.95/2.12 0 [] -r1($c9,Y)| -r1(Y,X2)|p14(X2).
% 1.95/2.12 0 [] -r1($c9,Y)| -r1(Y,X3)|p12(X3).
% 1.95/2.12 0 [] r1($c9,$c2).
% 1.95/2.12 0 [] r1($c2,$c1).
% 1.95/2.12 0 [] -p15($c1).
% 1.95/2.12 0 [] r1($c9,$c4).
% 1.95/2.12 0 [] r1($c4,$c3).
% 1.95/2.12 0 [] -p13($c3).
% 1.95/2.12 0 [] r1($c9,$c6).
% 1.95/2.12 0 [] r1($c6,$c5).
% 1.95/2.12 0 [] -p12($c5).
% 1.95/2.12 0 [] r1($c9,$c8).
% 1.95/2.12 0 [] r1($c8,$c7).
% 1.95/2.12 0 [] -p11($c7).
% 1.95/2.12 end_of_list.
% 1.95/2.12
% 1.95/2.12 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.95/2.12
% 1.95/2.12 This is a Horn set without equality. The strategy will
% 1.95/2.12 be hyperresolution, with satellites in sos and nuclei
% 1.95/2.12 in usable.
% 1.95/2.12
% 1.95/2.12 dependent: set(hyper_res).
% 1.95/2.12 dependent: clear(order_hyper).
% 1.95/2.12
% 1.95/2.12 ------------> process usable:
% 1.95/2.12 ** KEPT (pick-wt=9): 1 [] -r1(A,B)| -r1(B,C)|r1(A,C).
% 1.95/2.12 ** KEPT (pick-wt=8): 2 [] -r1($c9,A)| -r1(A,B)|p16(B).
% 1.95/2.12 ** KEPT (pick-wt=8): 3 [] -r1($c9,A)| -r1(A,B)|p12(B).
% 1.95/2.12 ** KEPT (pick-wt=8): 4 [] -r1($c9,A)| -r1(A,B)|p14(B).
% 1.95/2.12 Following clause subsumed by 3 during input processing: 0 [] -r1($c9,A)| -r1(A,B)|p12(B).
% 1.95/2.12 ** KEPT (pick-wt=2): 5 [] -p15($c1).
% 1.95/2.12 ** KEPT (pick-wt=2): 6 [] -p13($c3).
% 1.95/2.12 ** KEPT (pick-wt=2): 7 [] -p12($c5).
% 1.95/2.12 ** KEPT (pick-wt=2): 8 [] -p11($c7).
% 1.95/2.12
% 1.95/2.12 ------------> process sos:
% 1.95/2.12 ** KEPT (pick-wt=3): 9 [] r1(A,A).
% 1.95/2.12 ** KEPT (pick-wt=3): 10 [] r1($c9,$c2).
% 1.95/2.12 ** KEPT (pick-wt=3): 11 [] r1($c2,$c1).
% 1.95/2.12 ** KEPT (pick-wt=3): 12 [] r1($c9,$c4).
% 1.95/2.12 ** KEPT (pick-wt=3): 13 [] r1($c4,$c3).
% 1.95/2.12 ** KEPT (pick-wt=3): 14 [] r1($c9,$c6).
% 1.95/2.12 ** KEPT (pick-wt=3): 15 [] r1($c6,$c5).
% 1.95/2.12 ** KEPT (pick-wt=3): 16 [] r1($c9,$c8).
% 1.95/2.12 ** KEPT (pick-wt=3): 17 [] r1($c8,$c7).
% 1.95/2.12
% 1.95/2.12 ======= end of input processing =======
% 1.95/2.12
% 1.95/2.12 =========== start of search ===========
% 1.95/2.12
% 1.95/2.12 -------- PROOF --------
% 1.95/2.12
% 1.95/2.12 ----> UNIT CONFLICT at 0.00 sec ----> 40 [binary,39.1,7.1] $F.
% 1.95/2.12
% 1.95/2.12 Length of proof is 1. Level of proof is 1.
% 1.95/2.12
% 1.95/2.12 ---------------- PROOF ----------------
% 1.95/2.12 % SZS status Theorem
% 1.95/2.12 % SZS output start Refutation
% See solution above
% 1.95/2.12 ------------ end of proof -------------
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Search stopped by max_proofs option.
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Search stopped by max_proofs option.
% 1.95/2.12
% 1.95/2.12 ============ end of search ============
% 1.95/2.12
% 1.95/2.12 -------------- statistics -------------
% 1.95/2.12 clauses given 25
% 1.95/2.12 clauses generated 46
% 1.95/2.12 clauses kept 39
% 1.95/2.12 clauses forward subsumed 25
% 1.95/2.12 clauses back subsumed 0
% 1.95/2.12 Kbytes malloced 976
% 1.95/2.12
% 1.95/2.12 ----------- times (seconds) -----------
% 1.95/2.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.12
% 1.95/2.12 That finishes the proof of the theorem.
% 1.95/2.12
% 1.95/2.12 Process 9156 finished Wed Jul 27 09:29:56 2022
% 1.95/2.12 Otter interrupted
% 1.95/2.12 PROOF FOUND
%------------------------------------------------------------------------------