TSTP Solution File: NUM422+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM422+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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.24s 2.37s
% Output : CNFRefutation 7.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 46 ( 20 unt; 0 nHn; 46 RR)
% Number of literals : 86 ( 32 equ; 43 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_14) ).
cnf(i_0_21,hypothesis,
aInteger0(xa),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_21) ).
cnf(i_0_4,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_4) ).
cnf(i_0_3,plain,
aInteger0(sz10),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_3) ).
cnf(i_0_6,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/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/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_17) ).
cnf(i_0_15,plain,
( sdtasdt0(sz10,X1) = X1
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_15) ).
cnf(i_0_11,plain,
( sdtpldt0(smndt0(X1),X1) = sz00
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_11) ).
cnf(i_0_19,plain,
( sdtasdt0(sz00,X1) = sz00
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_19) ).
cnf(i_0_7,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_7) ).
cnf(i_0_9,plain,
( sdtpldt0(sz00,X1) = X1
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_9) ).
cnf(i_0_12,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_12) ).
cnf(i_0_22,negated_conjecture,
sdtasdt0(smndt0(sz10),xa) != smndt0(xa),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_22) ).
cnf(i_0_10,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a02ngz2l/input.p',i_0_10) ).
cnf(c_0_37,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_14 ).
cnf(c_0_38,hypothesis,
aInteger0(xa),
i_0_21 ).
cnf(c_0_39,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
i_0_4 ).
cnf(c_0_40,plain,
aInteger0(sz10),
i_0_3 ).
cnf(c_0_41,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_6 ).
cnf(c_0_42,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_43,hypothesis,
( sdtasdt0(X1,xa) = sdtasdt0(xa,X1)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
aInteger0(smndt0(sz10)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( sdtasdt0(sz10,X1) = X1
| ~ aInteger0(X1) ),
i_0_15 ).
cnf(c_0_46,plain,
( sdtpldt0(smndt0(X1),X1) = sz00
| ~ aInteger0(X1) ),
i_0_11 ).
cnf(c_0_47,plain,
( sdtasdt0(sz00,X1) = sz00
| ~ aInteger0(X1) ),
i_0_19 ).
cnf(c_0_48,hypothesis,
( aInteger0(sdtasdt0(X1,xa))
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_49,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_7 ).
cnf(c_0_50,hypothesis,
aInteger0(smndt0(xa)),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_51,plain,
( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(sz10,X2)) = sdtasdt0(sdtpldt0(X1,sz10),X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_40]) ).
cnf(c_0_52,plain,
sdtasdt0(smndt0(sz10),xa) = sdtasdt0(xa,smndt0(sz10)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_53,hypothesis,
sdtasdt0(sz10,xa) = xa,
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_54,plain,
sdtpldt0(smndt0(sz10),sz10) = sz00,
inference(spm,[status(thm)],[c_0_46,c_0_40]) ).
cnf(c_0_55,hypothesis,
sdtasdt0(sz00,xa) = sz00,
inference(spm,[status(thm)],[c_0_47,c_0_38]) ).
cnf(c_0_56,plain,
( sdtpldt0(sz00,X1) = X1
| ~ aInteger0(X1) ),
i_0_9 ).
cnf(c_0_57,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
i_0_12 ).
cnf(c_0_58,plain,
aInteger0(sdtasdt0(smndt0(sz10),xa)),
inference(spm,[status(thm)],[c_0_48,c_0_44]) ).
cnf(c_0_59,plain,
( sdtpldt0(sdtpldt0(X1,X2),smndt0(xa)) = sdtpldt0(X1,sdtpldt0(X2,smndt0(xa)))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,plain,
sdtpldt0(sdtasdt0(xa,smndt0(sz10)),xa) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54]),c_0_55]),c_0_38]),c_0_44])]) ).
cnf(c_0_61,plain,
sdtpldt0(sz00,smndt0(xa)) = smndt0(xa),
inference(spm,[status(thm)],[c_0_56,c_0_50]) ).
cnf(c_0_62,hypothesis,
sdtpldt0(xa,smndt0(xa)) = sz00,
inference(spm,[status(thm)],[c_0_57,c_0_38]) ).
cnf(c_0_63,plain,
aInteger0(sdtasdt0(xa,smndt0(sz10))),
inference(rw,[status(thm)],[c_0_58,c_0_52]) ).
cnf(c_0_64,negated_conjecture,
sdtasdt0(smndt0(sz10),xa) != smndt0(xa),
i_0_22 ).
cnf(c_0_65,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aInteger0(X1) ),
i_0_10 ).
cnf(c_0_66,plain,
sdtpldt0(sdtasdt0(xa,smndt0(sz10)),sz00) = smndt0(xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]),c_0_38]),c_0_63])]) ).
cnf(c_0_67,negated_conjecture,
sdtasdt0(xa,smndt0(sz10)) != smndt0(xa),
inference(rw,[status(thm)],[c_0_64,c_0_52]) ).
cnf(c_0_68,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_63])]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM422+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 : n029.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 : Thu Jul 7 08:08:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.24/2.37 # ENIGMATIC: Solved by autoschedule:
% 7.24/2.37 # No SInE strategy applied
% 7.24/2.37 # Trying AutoSched0 for 150 seconds
% 7.24/2.37 # AutoSched0-Mode selected heuristic G_E___107_C00_02_nc_F1_PI_AE_Q4_CS_SP_PS_S00EN
% 7.24/2.37 # and selection function PSelectSmallestOrientable.
% 7.24/2.37 #
% 7.24/2.37 # Preprocessing time : 0.020 s
% 7.24/2.37 # Presaturation interreduction done
% 7.24/2.37
% 7.24/2.37 # Proof found!
% 7.24/2.37 # SZS status Theorem
% 7.24/2.37 # SZS output start CNFRefutation
% See solution above
% 7.24/2.37 # Training examples: 0 positive, 0 negative
% 7.24/2.37
% 7.24/2.37 # -------------------------------------------------
% 7.24/2.37 # User time : 0.093 s
% 7.24/2.37 # System time : 0.008 s
% 7.24/2.37 # Total time : 0.100 s
% 7.24/2.37 # Maximum resident set size: 7124 pages
% 7.24/2.37
%------------------------------------------------------------------------------