TSTP Solution File: COM012+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM012+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 8.04s 2.56s
% Output : CNFRefutation 8.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 27 ( 18 unt; 6 nHn; 27 RR)
% Number of literals : 48 ( 9 equ; 19 neg)
% Maximal clause size : 7 ( 1 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 : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-lqlls5yp/lgb.p',i_0_11) ).
cnf(i_0_25,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_25) ).
cnf(i_0_17,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_17) ).
cnf(i_0_16,hypothesis,
aElement0(xy),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_16) ).
cnf(i_0_15,hypothesis,
aElement0(xz),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_15) ).
cnf(i_0_20,negated_conjecture,
~ sdtmndtplgtdt0(xx,xR,xz),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_20) ).
cnf(i_0_18,hypothesis,
aElement0(xx),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_18) ).
cnf(i_0_30,negated_conjecture,
( xx = xy
| sdtmndtplgtdt0(xx,xR,xy) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_30) ).
cnf(i_0_19,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_19) ).
cnf(i_0_24,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_24) ).
cnf(i_0_29,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lqlls5yp/lgb.p',i_0_29) ).
cnf(c_0_42,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_43,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(xy,xR,xz) ),
i_0_25 ).
cnf(c_0_44,hypothesis,
aRewritingSystem0(xR),
i_0_17 ).
cnf(c_0_45,hypothesis,
aElement0(xy),
i_0_16 ).
cnf(c_0_46,hypothesis,
aElement0(xz),
i_0_15 ).
cnf(c_0_47,negated_conjecture,
~ sdtmndtplgtdt0(xx,xR,xz),
i_0_20 ).
cnf(c_0_48,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(X1,xR,xz)
| ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,xR,xy) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_49,hypothesis,
aElement0(xx),
i_0_18 ).
cnf(c_0_50,negated_conjecture,
( xz = xy
| ~ sdtmndtplgtdt0(xx,xR,xy) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_51,negated_conjecture,
( xx = xy
| sdtmndtplgtdt0(xx,xR,xy) ),
i_0_30 ).
cnf(c_0_52,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
i_0_19 ).
cnf(c_0_53,negated_conjecture,
( xx = xy
| xz = xy ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
i_0_24 ).
cnf(c_0_55,negated_conjecture,
xz = xy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_56,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
i_0_29 ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : COM012+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Thu Jun 16 19:40:51 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 8.04/2.56 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.04/2.56 # No SInE strategy applied
% 8.04/2.56 # Trying AutoSched0 for 150 seconds
% 8.04/2.56 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.04/2.56 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.04/2.56 #
% 8.04/2.56 # Preprocessing time : 0.013 s
% 8.04/2.56
% 8.04/2.56 # Proof found!
% 8.04/2.56 # SZS status Theorem
% 8.04/2.56 # SZS output start CNFRefutation
% See solution above
% 8.04/2.56 # Training examples: 0 positive, 0 negative
% 8.04/2.56
% 8.04/2.56 # -------------------------------------------------
% 8.04/2.56 # User time : 0.017 s
% 8.04/2.56 # System time : 0.005 s
% 8.04/2.56 # Total time : 0.022 s
% 8.04/2.56 # Maximum resident set size: 7124 pages
% 8.04/2.56
%------------------------------------------------------------------------------