TSTP Solution File: LCL674+1.001 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL674+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:04 EDT 2022
% Result : Theorem 1.86s 2.07s
% Output : Refutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 7 unt; 1 nHn; 9 RR)
% Number of literals : 17 ( 0 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ r1(dollar_c1,A)
| p2(A) ),
file('LCL674+1.001.p',unknown),
[] ).
cnf(3,axiom,
( ~ r1(dollar_c1,A)
| r1(A,dollar_f1(A))
| p101(A)
| ~ p100(A) ),
file('LCL674+1.001.p',unknown),
[] ).
cnf(4,axiom,
( ~ r1(dollar_c1,A)
| ~ p2(dollar_f1(A))
| p101(A)
| ~ p100(A) ),
file('LCL674+1.001.p',unknown),
[] ).
cnf(16,axiom,
~ p101(dollar_c1),
file('LCL674+1.001.p',unknown),
[] ).
cnf(17,axiom,
r1(A,A),
file('LCL674+1.001.p',unknown),
[] ).
cnf(18,axiom,
p100(dollar_c1),
file('LCL674+1.001.p',unknown),
[] ).
cnf(24,plain,
r1(dollar_c1,dollar_f1(dollar_c1)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[18,3,17]),16]),
[iquote('hyper,18,3,17,unit_del,16')] ).
cnf(27,plain,
p2(dollar_f1(dollar_c1)),
inference(hyper,[status(thm)],[24,2]),
[iquote('hyper,24,2')] ).
cnf(28,plain,
p101(dollar_c1),
inference(hyper,[status(thm)],[27,4,17,18]),
[iquote('hyper,27,4,17,18')] ).
cnf(29,plain,
$false,
inference(binary,[status(thm)],[28,16]),
[iquote('binary,28.1,16.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL674+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n023.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:51:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.86/2.07 ----- Otter 3.3f, August 2004 -----
% 1.86/2.07 The process was started by sandbox2 on n023.cluster.edu,
% 1.86/2.07 Wed Jul 27 09:51:03 2022
% 1.86/2.07 The command was "./otter". The process ID is 18672.
% 1.86/2.07
% 1.86/2.07 set(prolog_style_variables).
% 1.86/2.07 set(auto).
% 1.86/2.07 dependent: set(auto1).
% 1.86/2.07 dependent: set(process_input).
% 1.86/2.07 dependent: clear(print_kept).
% 1.86/2.07 dependent: clear(print_new_demod).
% 1.86/2.07 dependent: clear(print_back_demod).
% 1.86/2.07 dependent: clear(print_back_sub).
% 1.86/2.07 dependent: set(control_memory).
% 1.86/2.07 dependent: assign(max_mem, 12000).
% 1.86/2.07 dependent: assign(pick_given_ratio, 4).
% 1.86/2.07 dependent: assign(stats_level, 1).
% 1.86/2.07 dependent: assign(max_seconds, 10800).
% 1.86/2.07 clear(print_given).
% 1.86/2.07
% 1.86/2.07 formula_list(usable).
% 1.86/2.07 all X r1(X,X).
% 1.86/2.07 all X Y Z (r1(X,Y)&r1(Y,Z)->r1(X,Z)).
% 1.86/2.07 -(-(exists X (-(-(all Y (-r1(X,Y)|p2(Y)))| -((all Y (-r1(X,Y)| (-(all X (-r1(Y,X)| -(-p2(X)& -p102(X)&p101(X))))& -(all X (-r1(Y,X)| -(p2(X)& -p102(X)&p101(X))))| -(-p101(Y)&p100(Y)))& (((all X (-r1(Y,X)| -p2(X)| -p101(X)))|p2(Y))& ((all X (-r1(Y,X)|p2(X)| -p101(X)))| -p2(Y))| -p101(Y))& (((all X (-r1(Y,X)| -p1(X)| -p100(X)))|p1(Y))& ((all X (-r1(Y,X)|p1(X)| -p100(X)))| -p1(Y))| -p100(Y))& (p101(Y)| -p102(Y))& (p100(Y)| -p101(Y))))& -p101(X)&p100(X)))))).
% 1.86/2.07 end_of_list.
% 1.86/2.07
% 1.86/2.07 -------> usable clausifies to:
% 1.86/2.07
% 1.86/2.07 list(usable).
% 1.86/2.07 0 [] r1(X,X).
% 1.86/2.07 0 [] -r1(X,Y)| -r1(Y,Z)|r1(X,Z).
% 1.86/2.07 0 [] -r1($c1,Y)|p2(Y).
% 1.86/2.07 0 [] -r1($c1,X1)|r1(X1,$f1(X1))|p101(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)| -p2($f1(X1))|p101(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)| -p102($f1(X1))|p101(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)|p101($f1(X1))|p101(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)|r1(X1,$f2(X1))|p101(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)|p2($f2(X1))|p101(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)| -p102($f2(X1))|p101(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)|p101($f2(X1))|p101(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)| -r1(X1,X)| -p2(X)| -p101(X)|p2(X1)| -p101(X1).
% 1.86/2.07 0 [] -r1($c1,X1)| -r1(X1,X2)|p2(X2)| -p101(X2)| -p2(X1)| -p101(X1).
% 1.86/2.07 0 [] -r1($c1,X1)| -r1(X1,X3)| -p1(X3)| -p100(X3)|p1(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)| -r1(X1,X4)|p1(X4)| -p100(X4)| -p1(X1)| -p100(X1).
% 1.86/2.07 0 [] -r1($c1,X1)|p101(X1)| -p102(X1).
% 1.86/2.07 0 [] -r1($c1,X1)|p100(X1)| -p101(X1).
% 1.86/2.07 0 [] -p101($c1).
% 1.86/2.07 0 [] p100($c1).
% 1.86/2.07 end_of_list.
% 1.86/2.07
% 1.86/2.07 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.86/2.07
% 1.86/2.07 This is a non-Horn set without equality. The strategy will
% 1.86/2.07 be ordered hyper_res, unit deletion, and factoring, with
% 1.86/2.07 satellites in sos and with nuclei in usable.
% 1.86/2.07
% 1.86/2.07 dependent: set(hyper_res).
% 1.86/2.07 dependent: set(factor).
% 1.86/2.07 dependent: set(unit_deletion).
% 1.86/2.07
% 1.86/2.07 ------------> process usable:
% 1.86/2.07 ** KEPT (pick-wt=9): 1 [] -r1(A,B)| -r1(B,C)|r1(A,C).
% 1.86/2.07 ** KEPT (pick-wt=5): 2 [] -r1($c1,A)|p2(A).
% 1.86/2.07 ** KEPT (pick-wt=11): 3 [] -r1($c1,A)|r1(A,$f1(A))|p101(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=10): 4 [] -r1($c1,A)| -p2($f1(A))|p101(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=10): 5 [] -r1($c1,A)| -p102($f1(A))|p101(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=10): 6 [] -r1($c1,A)|p101($f1(A))|p101(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=11): 7 [] -r1($c1,A)|r1(A,$f2(A))|p101(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=10): 8 [] -r1($c1,A)|p2($f2(A))|p101(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=10): 9 [] -r1($c1,A)| -p102($f2(A))|p101(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=10): 10 [] -r1($c1,A)|p101($f2(A))|p101(A)| -p100(A).
% 1.86/2.07 Following clause subsumed by 2 during input processing: 0 [] -r1($c1,A)| -r1(A,B)| -p2(B)| -p101(B)|p2(A)| -p101(A).
% 1.86/2.07 ** KEPT (pick-wt=14): 11 [] -r1($c1,A)| -r1(A,B)|p2(B)| -p101(B)| -p2(A)| -p101(A).
% 1.86/2.07 ** KEPT (pick-wt=14): 12 [] -r1($c1,A)| -r1(A,B)| -p1(B)| -p100(B)|p1(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=14): 13 [] -r1($c1,A)| -r1(A,B)|p1(B)| -p100(B)| -p1(A)| -p100(A).
% 1.86/2.07 ** KEPT (pick-wt=7): 14 [] -r1($c1,A)|p101(A)| -p102(A).
% 1.86/2.07 ** KEPT (pick-wt=7): 15 [] -r1($c1,A)|p100(A)| -p101(A).
% 1.86/2.07 ** KEPT (pick-wt=2): 16 [] -p101($c1).
% 1.86/2.07
% 1.86/2.07 ------------> process sos:
% 1.86/2.07 ** KEPT (pick-wt=3): 17 [] r1(A,A).
% 1.86/2.07 ** KEPT (pick-wt=2): 18 [] p100($c1).
% 1.86/2.07
% 1.86/2.07 ======= end of input processing =======
% 1.86/2.07
% 1.86/2.07 =========== start of search ===========
% 1.86/2.07
% 1.86/2.07 -------- PROOF --------
% 1.86/2.07
% 1.86/2.07 ----> UNIT CONFLICT at 0.00 sec ----> 29 [binary,28.1,16.1] $F.
% 1.86/2.07
% 1.86/2.07 Length of proof is 3. Level of proof is 3.
% 1.86/2.07
% 1.86/2.07 ---------------- PROOF ----------------
% 1.86/2.07 % SZS status Theorem
% 1.86/2.07 % SZS output start Refutation
% See solution above
% 1.86/2.07 ------------ end of proof -------------
% 1.86/2.07
% 1.86/2.07
% 1.86/2.07 Search stopped by max_proofs option.
% 1.86/2.07
% 1.86/2.07
% 1.86/2.07 Search stopped by max_proofs option.
% 1.86/2.07
% 1.86/2.07 ============ end of search ============
% 1.86/2.07
% 1.86/2.07 -------------- statistics -------------
% 1.86/2.07 clauses given 11
% 1.86/2.07 clauses generated 36
% 1.86/2.07 clauses kept 28
% 1.86/2.07 clauses forward subsumed 20
% 1.86/2.07 clauses back subsumed 0
% 1.86/2.07 Kbytes malloced 976
% 1.86/2.07
% 1.86/2.07 ----------- times (seconds) -----------
% 1.86/2.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.86/2.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.86/2.07 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.86/2.07
% 1.86/2.07 That finishes the proof of the theorem.
% 1.86/2.07
% 1.86/2.07 Process 18672 finished Wed Jul 27 09:51:05 2022
% 1.86/2.07 Otter interrupted
% 1.86/2.07 PROOF FOUND
%------------------------------------------------------------------------------