TSTP Solution File: NUM576+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM576+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : Mon Jul 18 08:37:32 EDT 2022
% Result : Theorem 9.09s 3.33s
% Output : CNFRefutation 9.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 15 unt; 3 nHn; 27 RR)
% Number of literals : 57 ( 5 equ; 33 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_56,plain,
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_56) ).
cnf(i_0_4182,hypothesis,
aElementOf0(xj,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_4182) ).
cnf(i_0_62,plain,
( sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_62) ).
cnf(i_0_4183,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_4183) ).
cnf(i_0_48,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_48) ).
cnf(i_0_4185,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xj),xi),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_4185) ).
cnf(i_0_60,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_60) ).
cnf(i_0_4184,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xi),xj),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_4184) ).
cnf(i_0_4186,negated_conjecture,
xj != xi,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pzt7b9sv/lgb.p',i_0_4186) ).
cnf(c_0_4196,plain,
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ),
i_0_56 ).
cnf(c_0_4197,hypothesis,
aElementOf0(xj,szNzAzT0),
i_0_4182 ).
cnf(c_0_4198,plain,
( sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_62 ).
cnf(c_0_4199,hypothesis,
aElementOf0(xi,szNzAzT0),
i_0_4183 ).
cnf(c_0_4200,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_48 ).
cnf(c_0_4201,hypothesis,
( sdtlseqdt0(X1,xj)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(xj)) ),
inference(spm,[status(thm)],[c_0_4196,c_0_4197]) ).
cnf(c_0_4202,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),X1)
| sdtlseqdt0(X1,xi)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_4198,c_0_4199]) ).
cnf(c_0_4203,hypothesis,
aElementOf0(szszuzczcdt0(xj),szNzAzT0),
inference(spm,[status(thm)],[c_0_4200,c_0_4197]) ).
cnf(c_0_4204,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xj),xi),
i_0_4185 ).
cnf(c_0_4205,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_60 ).
cnf(c_0_4206,hypothesis,
( sdtlseqdt0(xi,xj)
| ~ sdtlseqdt0(szszuzczcdt0(xi),szszuzczcdt0(xj)) ),
inference(spm,[status(thm)],[c_0_4201,c_0_4199]) ).
cnf(c_0_4207,hypothesis,
sdtlseqdt0(szszuzczcdt0(xi),szszuzczcdt0(xj)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4202,c_0_4203]),c_0_4204]) ).
cnf(c_0_4208,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xi),xj),
i_0_4184 ).
cnf(c_0_4209,hypothesis,
( X1 = xi
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(xi,X1)
| ~ sdtlseqdt0(X1,xi) ),
inference(spm,[status(thm)],[c_0_4205,c_0_4199]) ).
cnf(c_0_4210,hypothesis,
sdtlseqdt0(xi,xj),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4206,c_0_4207])]) ).
cnf(c_0_4211,hypothesis,
sdtlseqdt0(xj,xi),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4202,c_0_4197]),c_0_4208]) ).
cnf(c_0_4212,negated_conjecture,
xj != xi,
i_0_4186 ).
cnf(c_0_4213,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4209,c_0_4197]),c_0_4210]),c_0_4211])]),c_0_4212]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM576+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 : Tue Jul 5 10:15:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 9.09/3.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.09/3.33 # No SInE strategy applied
% 9.09/3.33 # Trying AutoSched0 for 150 seconds
% 9.09/3.33 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 9.09/3.33 # and selection function SelectNewComplexAHP.
% 9.09/3.33 #
% 9.09/3.33 # Preprocessing time : 0.024 s
% 9.09/3.33 # Presaturation interreduction done
% 9.09/3.33
% 9.09/3.33 # Proof found!
% 9.09/3.33 # SZS status Theorem
% 9.09/3.33 # SZS output start CNFRefutation
% See solution above
% 9.09/3.33 # Training examples: 0 positive, 0 negative
% 9.09/3.33
% 9.09/3.33 # -------------------------------------------------
% 9.09/3.33 # User time : 0.058 s
% 9.09/3.33 # System time : 0.006 s
% 9.09/3.33 # Total time : 0.064 s
% 9.09/3.33 # Maximum resident set size: 7128 pages
% 9.09/3.33
%------------------------------------------------------------------------------