TSTP Solution File: NUM432+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM432+3 : 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:56 EDT 2022
% Result : Theorem 9.06s 2.57s
% Output : CNFRefutation 9.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 18 ( 4 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_53,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xc))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hl32a705/lgb.p',i_0_53) ).
cnf(i_0_50,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hl32a705/lgb.p',i_0_50) ).
cnf(i_0_5,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hl32a705/lgb.p',i_0_5) ).
cnf(i_0_49,hypothesis,
aInteger0(xm),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hl32a705/lgb.p',i_0_49) ).
cnf(i_0_47,hypothesis,
aInteger0(xn),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hl32a705/lgb.p',i_0_47) ).
cnf(c_0_59,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xc))
| ~ aInteger0(X1) ),
i_0_53 ).
cnf(c_0_60,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
i_0_50 ).
cnf(c_0_61,negated_conjecture,
~ aInteger0(sdtpldt0(xn,xm)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_5 ).
cnf(c_0_63,hypothesis,
aInteger0(xm),
i_0_49 ).
cnf(c_0_64,hypothesis,
aInteger0(xn),
i_0_47 ).
cnf(c_0_65,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM432+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jul 6 03:22:01 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 9.06/2.57 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.06/2.57 # No SInE strategy applied
% 9.06/2.57 # Trying AutoSched0 for 150 seconds
% 9.06/2.57 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 9.06/2.57 # and selection function SelectNewComplexAHP.
% 9.06/2.57 #
% 9.06/2.57 # Preprocessing time : 0.023 s
% 9.06/2.57 # Presaturation interreduction done
% 9.06/2.57
% 9.06/2.57 # Proof found!
% 9.06/2.57 # SZS status Theorem
% 9.06/2.57 # SZS output start CNFRefutation
% See solution above
% 9.06/2.57 # Training examples: 0 positive, 0 negative
% 9.06/2.57
% 9.06/2.57 # -------------------------------------------------
% 9.06/2.57 # User time : 0.028 s
% 9.06/2.57 # System time : 0.005 s
% 9.06/2.57 # Total time : 0.033 s
% 9.06/2.57 # Maximum resident set size: 7120 pages
% 9.06/2.57
%------------------------------------------------------------------------------