TSTP Solution File: COM012+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM012+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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 12:48:21 EDT 2022
% Result : Theorem 1.74s 1.97s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 17 ( 12 unt; 3 nHn; 17 RR)
% Number of literals : 34 ( 3 equ; 15 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aElement0(C)
| ~ aElement0(D)
| ~ sdtmndtplgtdt0(A,B,C)
| ~ sdtmndtplgtdt0(C,B,D)
| sdtmndtplgtdt0(A,B,D) ),
file('COM012+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aElement0(C)
| ~ sdtmndtasgtdt0(A,B,C)
| A = C
| sdtmndtplgtdt0(A,B,C) ),
file('COM012+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ aElement0(A)
| ~ aRewritingSystem0(B)
| ~ aElement0(C)
| sdtmndtasgtdt0(A,B,C)
| ~ sdtmndtplgtdt0(A,B,C) ),
file('COM012+1.p',unknown),
[] ).
cnf(11,axiom,
~ sdtmndtasgtdt0(xx,xR,xz),
file('COM012+1.p',unknown),
[] ).
cnf(22,axiom,
aElement0(xx),
file('COM012+1.p',unknown),
[] ).
cnf(23,axiom,
aRewritingSystem0(xR),
file('COM012+1.p',unknown),
[] ).
cnf(24,axiom,
aElement0(xy),
file('COM012+1.p',unknown),
[] ).
cnf(25,axiom,
aElement0(xz),
file('COM012+1.p',unknown),
[] ).
cnf(26,axiom,
sdtmndtasgtdt0(xx,xR,xy),
file('COM012+1.p',unknown),
[] ).
cnf(27,axiom,
sdtmndtasgtdt0(xy,xR,xz),
file('COM012+1.p',unknown),
[] ).
cnf(32,plain,
( xy = xx
| sdtmndtplgtdt0(xx,xR,xy) ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[26,8,22,23,24])]),
[iquote('hyper,26,8,22,23,24,flip.1')] ).
cnf(36,plain,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz) ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[27,8,24,23,25])]),
[iquote('hyper,27,8,24,23,25,flip.1')] ).
cnf(58,plain,
sdtmndtplgtdt0(xx,xR,xy),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[32,27]),11]),
[iquote('para_from,32.1.1,27.1.1,unit_del,11')] ).
cnf(70,plain,
sdtmndtplgtdt0(xy,xR,xz),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[36,11]),26]),
[iquote('para_from,36.1.1,11.1.3,unit_del,26')] ).
cnf(71,plain,
sdtmndtplgtdt0(xx,xR,xz),
inference(hyper,[status(thm)],[70,7,22,23,24,25,58]),
[iquote('hyper,70,7,22,23,24,25,58')] ).
cnf(92,plain,
sdtmndtasgtdt0(xx,xR,xz),
inference(hyper,[status(thm)],[71,10,22,23,25]),
[iquote('hyper,71,10,22,23,25')] ).
cnf(93,plain,
$false,
inference(binary,[status(thm)],[92,11]),
[iquote('binary,92.1,11.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : COM012+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n028.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 06:44:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.74/1.96 ----- Otter 3.3f, August 2004 -----
% 1.74/1.96 The process was started by sandbox on n028.cluster.edu,
% 1.74/1.96 Wed Jul 27 06:44:33 2022
% 1.74/1.96 The command was "./otter". The process ID is 27776.
% 1.74/1.96
% 1.74/1.96 set(prolog_style_variables).
% 1.74/1.96 set(auto).
% 1.74/1.96 dependent: set(auto1).
% 1.74/1.96 dependent: set(process_input).
% 1.74/1.96 dependent: clear(print_kept).
% 1.74/1.96 dependent: clear(print_new_demod).
% 1.74/1.96 dependent: clear(print_back_demod).
% 1.74/1.96 dependent: clear(print_back_sub).
% 1.74/1.96 dependent: set(control_memory).
% 1.74/1.96 dependent: assign(max_mem, 12000).
% 1.74/1.96 dependent: assign(pick_given_ratio, 4).
% 1.74/1.96 dependent: assign(stats_level, 1).
% 1.74/1.96 dependent: assign(max_seconds, 10800).
% 1.74/1.96 clear(print_given).
% 1.74/1.96
% 1.74/1.96 formula_list(usable).
% 1.74/1.96 all A (A=A).
% 1.74/1.96 all W0 (aElement0(W0)->$T).
% 1.74/1.96 all W0 (aRewritingSystem0(W0)->$T).
% 1.74/1.96 all W0 W1 (aElement0(W0)&aRewritingSystem0(W1)-> (all W2 (aReductOfIn0(W2,W0,W1)->aElement0(W2)))).
% 1.74/1.96 all W0 W1 (aElement0(W0)&aElement0(W1)-> (iLess0(W0,W1)->$T)).
% 1.74/1.96 all W0 W1 W2 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)-> (sdtmndtplgtdt0(W0,W1,W2)->$T)).
% 1.74/1.96 all W0 W1 W2 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)-> (sdtmndtplgtdt0(W0,W1,W2)<->aReductOfIn0(W2,W0,W1)| (exists W3 (aElement0(W3)&aReductOfIn0(W3,W0,W1)&sdtmndtplgtdt0(W3,W1,W2))))).
% 1.74/1.96 all W0 W1 W2 W3 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)&aElement0(W3)-> (sdtmndtplgtdt0(W0,W1,W2)&sdtmndtplgtdt0(W2,W1,W3)->sdtmndtplgtdt0(W0,W1,W3))).
% 1.74/1.96 all W0 W1 W2 (aElement0(W0)&aRewritingSystem0(W1)&aElement0(W2)-> (sdtmndtasgtdt0(W0,W1,W2)<->W0=W2|sdtmndtplgtdt0(W0,W1,W2))).
% 1.74/1.96 aElement0(xx).
% 1.74/1.96 aRewritingSystem0(xR).
% 1.74/1.96 aElement0(xy).
% 1.74/1.96 aElement0(xz).
% 1.74/1.96 -(sdtmndtasgtdt0(xx,xR,xy)&sdtmndtasgtdt0(xy,xR,xz)->sdtmndtasgtdt0(xx,xR,xz)).
% 1.74/1.96 end_of_list.
% 1.74/1.96
% 1.74/1.96 -------> usable clausifies to:
% 1.74/1.96
% 1.74/1.96 list(usable).
% 1.74/1.96 0 [] A=A.
% 1.74/1.96 0 [] -aElement0(W0)|$T.
% 1.74/1.96 0 [] -aRewritingSystem0(W0)|$T.
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aReductOfIn0(W2,W0,W1)|aElement0(W2).
% 1.74/1.96 0 [] -aElement0(W0)| -aElement0(W1)| -iLess0(W0,W1)|$T.
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W0,W1,W2)|$T.
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W0,W1,W2)|aReductOfIn0(W2,W0,W1)|aElement0($f1(W0,W1,W2)).
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W0,W1,W2)|aReductOfIn0(W2,W0,W1)|aReductOfIn0($f1(W0,W1,W2),W0,W1).
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtplgtdt0(W0,W1,W2)|aReductOfIn0(W2,W0,W1)|sdtmndtplgtdt0($f1(W0,W1,W2),W1,W2).
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)|sdtmndtplgtdt0(W0,W1,W2)| -aReductOfIn0(W2,W0,W1).
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)|sdtmndtplgtdt0(W0,W1,W2)| -aElement0(W3)| -aReductOfIn0(W3,W0,W1)| -sdtmndtplgtdt0(W3,W1,W2).
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -aElement0(W3)| -sdtmndtplgtdt0(W0,W1,W2)| -sdtmndtplgtdt0(W2,W1,W3)|sdtmndtplgtdt0(W0,W1,W3).
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)| -sdtmndtasgtdt0(W0,W1,W2)|W0=W2|sdtmndtplgtdt0(W0,W1,W2).
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)|sdtmndtasgtdt0(W0,W1,W2)|W0!=W2.
% 1.74/1.96 0 [] -aElement0(W0)| -aRewritingSystem0(W1)| -aElement0(W2)|sdtmndtasgtdt0(W0,W1,W2)| -sdtmndtplgtdt0(W0,W1,W2).
% 1.74/1.96 0 [] aElement0(xx).
% 1.74/1.96 0 [] aRewritingSystem0(xR).
% 1.74/1.96 0 [] aElement0(xy).
% 1.74/1.96 0 [] aElement0(xz).
% 1.74/1.96 0 [] sdtmndtasgtdt0(xx,xR,xy).
% 1.74/1.96 0 [] sdtmndtasgtdt0(xy,xR,xz).
% 1.74/1.96 0 [] -sdtmndtasgtdt0(xx,xR,xz).
% 1.74/1.96 end_of_list.
% 1.74/1.96
% 1.74/1.96 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.74/1.96
% 1.74/1.96 This ia a non-Horn set with equality. The strategy will be
% 1.74/1.96 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.74/1.96 deletion, with positive clauses in sos and nonpositive
% 1.74/1.96 clauses in usable.
% 1.74/1.96
% 1.74/1.96 dependent: set(knuth_bendix).
% 1.74/1.96 dependent: set(anl_eq).
% 1.74/1.96 dependent: set(para_from).
% 1.74/1.96 dependent: set(para_into).
% 1.74/1.96 dependent: clear(para_from_right).
% 1.74/1.96 dependent: clear(para_into_right).
% 1.74/1.96 dependent: set(para_from_vars).
% 1.74/1.96 dependent: set(eq_units_both_ways).
% 1.74/1.96 dependent: set(dynamic_demod_all).
% 1.74/1.96 dependent: set(dynamic_demod).
% 1.74/1.96 dependent: set(order_eq).
% 1.74/1.96 dependent: set(back_demod).
% 1.74/1.96 dependent: set(lrpo).
% 1.74/1.96 dependent: set(hyper_res).
% 1.74/1.96 dependent: set(unit_deletion).
% 1.74/1.97 dependent: set(factor).
% 1.74/1.97
% 1.74/1.97 ------------> process usable:
% 1.74/1.97 ** KEPT (pick-wt=10): 1 [] -aElement0(A)| -aRewritingSystem0(B)| -aReductOfIn0(C,A,B)|aElement0(C).
% 1.74/1.97 ** KEPT (pick-wt=19): 2 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|aElement0($f1(A,B,C)).
% 1.74/1.97 ** KEPT (pick-wt=21): 3 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|aReductOfIn0($f1(A,B,C),A,B).
% 1.74/1.97 ** KEPT (pick-wt=21): 4 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|sdtmndtplgtdt0($f1(A,B,C),B,C).
% 1.74/1.97 ** KEPT (pick-wt=14): 5 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtplgtdt0(A,B,C)| -aReductOfIn0(C,A,B).
% 1.74/1.97 ** KEPT (pick-wt=20): 6 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtplgtdt0(A,B,C)| -aElement0(D)| -aReductOfIn0(D,A,B)| -sdtmndtplgtdt0(D,B,C).
% 1.74/1.97 ** KEPT (pick-wt=20): 7 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtplgtdt0(A,B,C)| -sdtmndtplgtdt0(C,B,D)|sdtmndtplgtdt0(A,B,D).
% 1.74/1.97 ** KEPT (pick-wt=17): 8 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtasgtdt0(A,B,C)|A=C|sdtmndtplgtdt0(A,B,C).
% 1.74/1.97 ** KEPT (pick-wt=13): 9 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)|A!=C.
% 1.74/1.97 ** KEPT (pick-wt=14): 10 [] -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)| -sdtmndtplgtdt0(A,B,C).
% 1.74/1.97 ** KEPT (pick-wt=4): 11 [] -sdtmndtasgtdt0(xx,xR,xz).
% 1.74/1.97
% 1.74/1.97 ------------> process sos:
% 1.74/1.97 ** KEPT (pick-wt=3): 21 [] A=A.
% 1.74/1.97 ** KEPT (pick-wt=2): 22 [] aElement0(xx).
% 1.74/1.97 ** KEPT (pick-wt=2): 23 [] aRewritingSystem0(xR).
% 1.74/1.97 ** KEPT (pick-wt=2): 24 [] aElement0(xy).
% 1.74/1.97 ** KEPT (pick-wt=2): 25 [] aElement0(xz).
% 1.74/1.97 ** KEPT (pick-wt=4): 26 [] sdtmndtasgtdt0(xx,xR,xy).
% 1.74/1.97 ** KEPT (pick-wt=4): 27 [] sdtmndtasgtdt0(xy,xR,xz).
% 1.74/1.97 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] A=A.
% 1.74/1.97 21 back subsumes 18.
% 1.74/1.97
% 1.74/1.97 ======= end of input processing =======
% 1.74/1.97
% 1.74/1.97 =========== start of search ===========
% 1.74/1.97
% 1.74/1.97 -------- PROOF --------
% 1.74/1.97
% 1.74/1.97 ----> UNIT CONFLICT at 0.01 sec ----> 93 [binary,92.1,11.1] $F.
% 1.74/1.97
% 1.74/1.97 Length of proof is 6. Level of proof is 4.
% 1.74/1.97
% 1.74/1.97 ---------------- PROOF ----------------
% 1.74/1.97 % SZS status Theorem
% 1.74/1.97 % SZS output start Refutation
% See solution above
% 1.74/1.97 ------------ end of proof -------------
% 1.74/1.97
% 1.74/1.97
% 1.74/1.97 Search stopped by max_proofs option.
% 1.74/1.97
% 1.74/1.97
% 1.74/1.97 Search stopped by max_proofs option.
% 1.74/1.97
% 1.74/1.97 ============ end of search ============
% 1.74/1.97
% 1.74/1.97 -------------- statistics -------------
% 1.74/1.97 clauses given 17
% 1.74/1.97 clauses generated 165
% 1.74/1.97 clauses kept 92
% 1.74/1.97 clauses forward subsumed 82
% 1.74/1.97 clauses back subsumed 13
% 1.74/1.97 Kbytes malloced 976
% 1.74/1.97
% 1.74/1.97 ----------- times (seconds) -----------
% 1.74/1.97 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.74/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.74/1.97 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.74/1.97
% 1.74/1.97 That finishes the proof of the theorem.
% 1.74/1.97
% 1.74/1.97 Process 27776 finished Wed Jul 27 06:44:35 2022
% 1.74/1.97 Otter interrupted
% 1.74/1.97 PROOF FOUND
%------------------------------------------------------------------------------