TSTP Solution File: NUM539+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM539+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:07 EDT 2022
% Result : Theorem 7.38s 2.36s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 13 unt; 0 nHn; 22 RR)
% Number of literals : 39 ( 5 equ; 19 neg)
% Maximal clause size : 5 ( 1 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 : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_91,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fcyzrdm0/lgb.p',i_0_91) ).
cnf(i_0_93,hypothesis,
aElementOf0(szmzizndt0(xT),xS),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fcyzrdm0/lgb.p',i_0_93) ).
cnf(i_0_60,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fcyzrdm0/lgb.p',i_0_60) ).
cnf(i_0_98,hypothesis,
aElementOf0(szmzizndt0(xS),xS),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fcyzrdm0/lgb.p',i_0_98) ).
cnf(i_0_94,hypothesis,
( sdtlseqdt0(szmzizndt0(xT),X1)
| ~ aElementOf0(X1,xT) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fcyzrdm0/lgb.p',i_0_94) ).
cnf(i_0_96,hypothesis,
aElementOf0(szmzizndt0(xS),xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fcyzrdm0/lgb.p',i_0_96) ).
cnf(i_0_97,hypothesis,
( sdtlseqdt0(szmzizndt0(xS),X1)
| ~ aElementOf0(X1,xS) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fcyzrdm0/lgb.p',i_0_97) ).
cnf(i_0_99,negated_conjecture,
szmzizndt0(xT) != szmzizndt0(xS),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fcyzrdm0/lgb.p',i_0_99) ).
cnf(c_0_108,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
i_0_91 ).
cnf(c_0_109,hypothesis,
aElementOf0(szmzizndt0(xT),xS),
i_0_93 ).
cnf(c_0_110,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_60 ).
cnf(c_0_111,hypothesis,
aElementOf0(szmzizndt0(xT),szNzAzT0),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_112,hypothesis,
aElementOf0(szmzizndt0(xS),xS),
i_0_98 ).
cnf(c_0_113,hypothesis,
( sdtlseqdt0(szmzizndt0(xT),X1)
| ~ aElementOf0(X1,xT) ),
i_0_94 ).
cnf(c_0_114,hypothesis,
aElementOf0(szmzizndt0(xS),xT),
i_0_96 ).
cnf(c_0_115,hypothesis,
( sdtlseqdt0(szmzizndt0(xS),X1)
| ~ aElementOf0(X1,xS) ),
i_0_97 ).
cnf(c_0_116,plain,
( X1 = szmzizndt0(xT)
| ~ sdtlseqdt0(szmzizndt0(xT),X1)
| ~ sdtlseqdt0(X1,szmzizndt0(xT))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_117,hypothesis,
aElementOf0(szmzizndt0(xS),szNzAzT0),
inference(spm,[status(thm)],[c_0_108,c_0_112]) ).
cnf(c_0_118,hypothesis,
sdtlseqdt0(szmzizndt0(xT),szmzizndt0(xS)),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_119,hypothesis,
sdtlseqdt0(szmzizndt0(xS),szmzizndt0(xT)),
inference(spm,[status(thm)],[c_0_115,c_0_109]) ).
cnf(c_0_120,negated_conjecture,
szmzizndt0(xT) != szmzizndt0(xS),
i_0_99 ).
cnf(c_0_121,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118]),c_0_119])]),c_0_120]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM539+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n007.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 : Wed Jul 6 15:01:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 7.38/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.38/2.36 # No SInE strategy applied
% 7.38/2.36 # Trying AutoSched0 for 150 seconds
% 7.38/2.36 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.38/2.36 # and selection function SelectNewComplexAHP.
% 7.38/2.36 #
% 7.38/2.36 # Preprocessing time : 0.013 s
% 7.38/2.36 # Presaturation interreduction done
% 7.38/2.36
% 7.38/2.36 # Proof found!
% 7.38/2.36 # SZS status Theorem
% 7.38/2.36 # SZS output start CNFRefutation
% See solution above
% 7.38/2.36 # Training examples: 0 positive, 0 negative
% 7.38/2.36
% 7.38/2.36 # -------------------------------------------------
% 7.38/2.36 # User time : 0.017 s
% 7.38/2.36 # System time : 0.006 s
% 7.38/2.36 # Total time : 0.023 s
% 7.38/2.36 # Maximum resident set size: 7124 pages
% 7.38/2.36
%------------------------------------------------------------------------------