TSTP Solution File: COM012+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM012+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Fri Jul 15 01:06:56 EDT 2022
% Result : Theorem 7.42s 2.18s
% Output : CNFRefutation 7.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 17 unt; 5 nHn; 28 RR)
% Number of literals : 64 ( 8 equ; 35 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_19) ).
cnf(i_0_12,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_12) ).
cnf(i_0_17,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_17) ).
cnf(i_0_15,hypothesis,
aElement0(xz),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_15) ).
cnf(i_0_18,hypothesis,
aElement0(xx),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_18) ).
cnf(i_0_11,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| ~ sdtmndtplgtdt0(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_11) ).
cnf(i_0_14,plain,
( X1 = X2
| sdtmndtplgtdt0(X1,X3,X2)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_14) ).
cnf(i_0_20,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_20) ).
cnf(i_0_16,hypothesis,
aElement0(xy),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_16) ).
cnf(i_0_21,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9fkowoq3/lgb.p',i_0_21) ).
cnf(c_0_32,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
i_0_19 ).
cnf(c_0_33,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(X1,X2,X3) ),
i_0_12 ).
cnf(c_0_34,hypothesis,
aRewritingSystem0(xR),
i_0_17 ).
cnf(c_0_35,hypothesis,
aElement0(xz),
i_0_15 ).
cnf(c_0_36,hypothesis,
aElement0(xx),
i_0_18 ).
cnf(c_0_37,negated_conjecture,
~ sdtmndtplgtdt0(xx,xR,xz),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_38,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| ~ sdtmndtplgtdt0(X1,X2,X4) ),
i_0_11 ).
cnf(c_0_39,plain,
( X1 = X2
| sdtmndtplgtdt0(X1,X3,X2)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X1,X3,X2) ),
i_0_14 ).
cnf(c_0_40,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
i_0_20 ).
cnf(c_0_41,hypothesis,
aElement0(xy),
i_0_16 ).
cnf(c_0_42,negated_conjecture,
( ~ sdtmndtplgtdt0(X1,xR,xz)
| ~ sdtmndtplgtdt0(xx,xR,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_43,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34]),c_0_35]),c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
i_0_21 ).
cnf(c_0_45,negated_conjecture,
( xz = xy
| ~ sdtmndtplgtdt0(xx,xR,xy) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_41])]) ).
cnf(c_0_46,negated_conjecture,
( xx = xy
| sdtmndtplgtdt0(xx,xR,xy) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_44]),c_0_34]),c_0_41]),c_0_36])]) ).
cnf(c_0_47,negated_conjecture,
( xx = xy
| xz = xy ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
xz = xy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_47]),c_0_40])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_48]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM012+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n009.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 : 600
% 0.12/0.33 % DateTime : Thu Jun 16 19:38:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.42/2.18 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.42/2.18 # No SInE strategy applied
% 7.42/2.18 # Trying AutoSched0 for 150 seconds
% 7.42/2.18 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S035N
% 7.42/2.18 # and selection function PSelectUnlessPosMax.
% 7.42/2.18 #
% 7.42/2.18 # Preprocessing time : 0.012 s
% 7.42/2.18 # Presaturation interreduction done
% 7.42/2.18
% 7.42/2.18 # Proof found!
% 7.42/2.18 # SZS status Theorem
% 7.42/2.18 # SZS output start CNFRefutation
% See solution above
% 7.42/2.18 # Training examples: 0 positive, 0 negative
% 7.42/2.18
% 7.42/2.18 # -------------------------------------------------
% 7.42/2.18 # User time : 0.014 s
% 7.42/2.18 # System time : 0.004 s
% 7.42/2.18 # Total time : 0.018 s
% 7.42/2.18 # Maximum resident set size: 7124 pages
% 7.42/2.18
%------------------------------------------------------------------------------