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