TSTP Solution File: COM021+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM021+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Fri Jul 15 01:07:01 EDT 2022
% Result : Theorem 8.76s 2.45s
% Output : CNFRefutation 8.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 27 ( 18 unt; 5 nHn; 27 RR)
% Number of literals : 60 ( 4 equ; 33 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 27 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_42,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aNormalFormOfIn0(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_42) ).
cnf(i_0_64,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_64) ).
cnf(i_0_44,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_44) ).
cnf(i_0_63,hypothesis,
aElement0(xw),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_63) ).
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-9cvg4g_f/lgb.p',i_0_14) ).
cnf(i_0_65,hypothesis,
sdtmndtasgtdt0(xd,xR,xx),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_65) ).
cnf(i_0_67,hypothesis,
aElement0(xx),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_67) ).
cnf(i_0_40,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X4,X2)
| ~ aNormalFormOfIn0(X4,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_40) ).
cnf(i_0_9,plain,
( aReductOfIn0(X1,X2,X3)
| aReductOfIn0(esk1_3(X2,X3,X1),X2,X3)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtplgtdt0(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_9) ).
cnf(i_0_66,hypothesis,
sdtmndtasgtdt0(xb,xR,xx),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_66) ).
cnf(i_0_68,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9cvg4g_f/lgb.p',i_0_68) ).
cnf(c_0_80,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aNormalFormOfIn0(X1,X2,X3) ),
i_0_42 ).
cnf(c_0_81,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
i_0_64 ).
cnf(c_0_82,hypothesis,
aRewritingSystem0(xR),
i_0_44 ).
cnf(c_0_83,hypothesis,
aElement0(xw),
i_0_63 ).
cnf(c_0_84,plain,
( X1 = X2
| sdtmndtplgtdt0(X1,X3,X2)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X1,X3,X2) ),
i_0_14 ).
cnf(c_0_85,hypothesis,
sdtmndtasgtdt0(xd,xR,xx),
i_0_65 ).
cnf(c_0_86,hypothesis,
aElement0(xx),
i_0_67 ).
cnf(c_0_87,hypothesis,
aElement0(xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]),c_0_83])]) ).
cnf(c_0_88,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X4,X2)
| ~ aNormalFormOfIn0(X4,X1,X2) ),
i_0_40 ).
cnf(c_0_89,plain,
( aReductOfIn0(X1,X2,X3)
| aReductOfIn0(esk1_3(X2,X3,X1),X2,X3)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtplgtdt0(X2,X3,X1) ),
i_0_9 ).
cnf(c_0_90,hypothesis,
( xx = xd
| sdtmndtplgtdt0(xd,xR,xx) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_82]),c_0_86])]),c_0_87])]) ).
cnf(c_0_91,hypothesis,
~ aReductOfIn0(X1,xd,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_81]),c_0_82]),c_0_83])]) ).
cnf(c_0_92,hypothesis,
sdtmndtasgtdt0(xb,xR,xx),
i_0_66 ).
cnf(c_0_93,plain,
xx = xd,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_82]),c_0_87]),c_0_86])]),c_0_91]),c_0_91]) ).
cnf(c_0_94,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
i_0_68 ).
cnf(c_0_95,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93]),c_0_94]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : COM021+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 18:36:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.76/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.76/2.45 # No SInE strategy applied
% 8.76/2.45 # Trying AutoSched0 for 150 seconds
% 8.76/2.45 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 8.76/2.45 # and selection function SelectNewComplexAHPNS.
% 8.76/2.45 #
% 8.76/2.45 # Preprocessing time : 0.024 s
% 8.76/2.45
% 8.76/2.45 # Proof found!
% 8.76/2.45 # SZS status Theorem
% 8.76/2.45 # SZS output start CNFRefutation
% See solution above
% 8.76/2.45 # Training examples: 0 positive, 0 negative
% 8.76/2.45
% 8.76/2.45 # -------------------------------------------------
% 8.76/2.45 # User time : 0.027 s
% 8.76/2.45 # System time : 0.008 s
% 8.76/2.45 # Total time : 0.034 s
% 8.76/2.45 # Maximum resident set size: 7132 pages
% 8.76/2.45
%------------------------------------------------------------------------------