TSTP Solution File: NUM421+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM421+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:35:49 EDT 2022
% Result : Theorem 7.97s 2.44s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 13 unt; 0 nHn; 34 RR)
% Number of literals : 68 ( 26 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_14) ).
cnf(i_0_19,hypothesis,
aInteger0(xa),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_19) ).
cnf(i_0_2,plain,
aInteger0(sz00),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_2) ).
cnf(i_0_10,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_10) ).
cnf(i_0_6,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_6) ).
cnf(i_0_17,plain,
( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2)) = sdtasdt0(sdtpldt0(X1,X3),X2)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_17) ).
cnf(i_0_7,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_7) ).
cnf(i_0_11,plain,
( sdtpldt0(smndt0(X1),X1) = sz00
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_11) ).
cnf(i_0_4,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_4) ).
cnf(i_0_9,plain,
( sdtpldt0(sz00,X1) = X1
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_9) ).
cnf(i_0_20,negated_conjecture,
( sdtasdt0(sz00,xa) != sz00
| sdtasdt0(xa,sz00) != sz00 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w6xljsmm/input.p',i_0_20) ).
cnf(c_0_32,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_14 ).
cnf(c_0_33,hypothesis,
aInteger0(xa),
i_0_19 ).
cnf(c_0_34,hypothesis,
( sdtasdt0(X1,xa) = sdtasdt0(xa,X1)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
aInteger0(sz00),
i_0_2 ).
cnf(c_0_36,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aInteger0(X1) ),
i_0_10 ).
cnf(c_0_37,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_6 ).
cnf(c_0_38,plain,
sdtasdt0(sz00,xa) = sdtasdt0(xa,sz00),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2)) = sdtasdt0(sdtpldt0(X1,X3),X2)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
i_0_17 ).
cnf(c_0_40,plain,
sdtpldt0(sz00,sz00) = sz00,
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_41,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_7 ).
cnf(c_0_42,plain,
( sdtpldt0(smndt0(X1),X1) = sz00
| ~ aInteger0(X1) ),
i_0_11 ).
cnf(c_0_43,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
i_0_4 ).
cnf(c_0_44,plain,
aInteger0(sdtasdt0(xa,sz00)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33]),c_0_35])]) ).
cnf(c_0_45,plain,
( sdtpldt0(sdtasdt0(sz00,X1),sdtasdt0(sz00,X1)) = sdtasdt0(sz00,X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35])]) ).
cnf(c_0_46,plain,
( sdtpldt0(smndt0(X1),sdtpldt0(X1,X2)) = sdtpldt0(sz00,X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
sdtpldt0(sdtasdt0(xa,sz00),sz00) = sdtasdt0(xa,sz00),
inference(spm,[status(thm)],[c_0_36,c_0_44]) ).
cnf(c_0_48,plain,
( sdtpldt0(sz00,X1) = X1
| ~ aInteger0(X1) ),
i_0_9 ).
cnf(c_0_49,negated_conjecture,
( sdtasdt0(sz00,xa) != sz00
| sdtasdt0(xa,sz00) != sz00 ),
i_0_20 ).
cnf(c_0_50,hypothesis,
sdtpldt0(sdtasdt0(xa,sz00),sdtasdt0(xa,sz00)) = sdtasdt0(xa,sz00),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_33]),c_0_38]),c_0_38]),c_0_38]) ).
cnf(c_0_51,plain,
sdtpldt0(smndt0(sdtasdt0(xa,sz00)),sdtasdt0(xa,sz00)) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_40]),c_0_35]),c_0_44])]) ).
cnf(c_0_52,plain,
sdtpldt0(sz00,sdtasdt0(xa,sz00)) = sdtasdt0(xa,sz00),
inference(spm,[status(thm)],[c_0_48,c_0_44]) ).
cnf(c_0_53,negated_conjecture,
sdtasdt0(xa,sz00) != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_38])]) ).
cnf(c_0_54,plain,
$false,
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_46,c_0_50]),c_0_51]),c_0_52]),c_0_44])]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM421+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n013.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 Jul 7 22:43:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.97/2.44 # ENIGMATIC: Solved by autoschedule:
% 7.97/2.44 # No SInE strategy applied
% 7.97/2.44 # Trying AutoSched0 for 150 seconds
% 7.97/2.44 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S04CN
% 7.97/2.44 # and selection function MSelectComplexExceptUniqMaxHorn.
% 7.97/2.44 #
% 7.97/2.44 # Preprocessing time : 0.012 s
% 7.97/2.44 # Presaturation interreduction done
% 7.97/2.44
% 7.97/2.44 # Proof found!
% 7.97/2.44 # SZS status Theorem
% 7.97/2.44 # SZS output start CNFRefutation
% See solution above
% 7.97/2.44 # Training examples: 0 positive, 0 negative
% 7.97/2.44
% 7.97/2.44 # -------------------------------------------------
% 7.97/2.44 # User time : 0.034 s
% 7.97/2.44 # System time : 0.003 s
% 7.97/2.44 # Total time : 0.037 s
% 7.97/2.44 # Maximum resident set size: 7116 pages
% 7.97/2.44
%------------------------------------------------------------------------------