TSTP Solution File: NUM465+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM465+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:36:17 EDT 2022
% Result : Theorem 7.40s 2.35s
% Output : CNFRefutation 7.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 40 ( 17 unt; 10 nHn; 40 RR)
% Number of literals : 83 ( 26 equ; 34 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_49,hypothesis,
( sz00 = xm
| sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_49) ).
cnf(i_0_51,negated_conjecture,
sz00 != xm,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_51) ).
cnf(i_0_43,plain,
( X1 = X2
| X3 = sz00
| sdtlseqdt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_43) ).
cnf(i_0_48,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_48) ).
cnf(i_0_4,plain,
aNaturalNumber0(sz10),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_4) ).
cnf(i_0_47,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_47) ).
cnf(i_0_14,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_14) ).
cnf(i_0_50,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_50) ).
cnf(i_0_15,plain,
( sdtasdt0(sz00,X1) = sz00
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_15) ).
cnf(i_0_32,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_32) ).
cnf(i_0_2,plain,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_2) ).
cnf(i_0_35,plain,
( sdtlseqdt0(X1,X2)
| sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_35) ).
cnf(i_0_11,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_11) ).
cnf(i_0_13,plain,
( sdtasdt0(sz10,X1) = X1
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yslff4pz/lgb.p',i_0_13) ).
cnf(c_0_66,hypothesis,
( sz00 = xm
| sdtlseqdt0(sz10,xm) ),
i_0_49 ).
cnf(c_0_67,negated_conjecture,
sz00 != xm,
i_0_51 ).
cnf(c_0_68,plain,
( X1 = X2
| X3 = sz00
| sdtlseqdt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X1,X2) ),
i_0_43 ).
cnf(c_0_69,hypothesis,
sdtlseqdt0(sz10,xm),
inference(sr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,hypothesis,
aNaturalNumber0(xm),
i_0_48 ).
cnf(c_0_71,plain,
aNaturalNumber0(sz10),
i_0_4 ).
cnf(c_0_72,hypothesis,
( sz10 = xm
| X1 = sz00
| sdtlseqdt0(sdtasdt0(X1,sz10),sdtasdt0(X1,xm))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71])]) ).
cnf(c_0_73,hypothesis,
aNaturalNumber0(xn),
i_0_47 ).
cnf(c_0_74,hypothesis,
( xn = sz00
| sz10 = xm
| sdtlseqdt0(sdtasdt0(xn,sz10),sdtasdt0(xn,xm)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
i_0_14 ).
cnf(c_0_76,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
i_0_50 ).
cnf(c_0_77,plain,
( sz10 = xm
| xn = sz00 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_73])]),c_0_76]) ).
cnf(c_0_78,negated_conjecture,
( sz10 = xm
| ~ sdtlseqdt0(sz00,sdtasdt0(sz00,xm)) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_79,plain,
( sdtasdt0(sz00,X1) = sz00
| ~ aNaturalNumber0(X1) ),
i_0_15 ).
cnf(c_0_80,plain,
( sz10 = xm
| ~ sdtlseqdt0(sz00,sz00) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_70])]) ).
cnf(c_0_81,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
i_0_32 ).
cnf(c_0_82,plain,
aNaturalNumber0(sz00),
i_0_2 ).
cnf(c_0_83,plain,
( sdtlseqdt0(X1,X2)
| sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
i_0_35 ).
cnf(c_0_84,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_11 ).
cnf(c_0_85,plain,
( sdtasdt0(sz10,X1) = X1
| ~ aNaturalNumber0(X1) ),
i_0_13 ).
cnf(c_0_86,plain,
sz10 = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82])]) ).
cnf(c_0_87,hypothesis,
( sdtlseqdt0(X1,xn)
| sdtlseqdt0(xn,X1)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_73]) ).
cnf(c_0_88,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xm,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_84]),c_0_73]),c_0_70])]) ).
cnf(c_0_89,plain,
( sdtasdt0(xm,X1) = X1
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,hypothesis,
sdtlseqdt0(xn,xn),
inference(spm,[status(thm)],[c_0_87,c_0_73]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM465+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 17:52:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.40/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.40/2.35 # No SInE strategy applied
% 7.40/2.35 # Trying AutoSched0 for 150 seconds
% 7.40/2.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AN
% 7.40/2.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.40/2.35 #
% 7.40/2.35 # Preprocessing time : 0.025 s
% 7.40/2.35 # Presaturation interreduction done
% 7.40/2.35
% 7.40/2.35 # Proof found!
% 7.40/2.35 # SZS status Theorem
% 7.40/2.35 # SZS output start CNFRefutation
% See solution above
% 7.40/2.35 # Training examples: 0 positive, 0 negative
% 7.40/2.35
% 7.40/2.35 # -------------------------------------------------
% 7.40/2.35 # User time : 0.049 s
% 7.40/2.35 # System time : 0.006 s
% 7.40/2.35 # Total time : 0.055 s
% 7.40/2.35 # Maximum resident set size: 7124 pages
% 7.40/2.35
%------------------------------------------------------------------------------