TSTP Solution File: NUM436+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM436+3 : 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:35:59 EDT 2022
% Result : Theorem 7.33s 2.35s
% Output : CNFRefutation 7.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 13 unt; 0 nHn; 20 RR)
% Number of literals : 36 ( 13 equ; 22 neg)
% Maximal clause size : 4 ( 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 : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_57,negated_conjecture,
( sdtasdt0(xp,X1) != sdtpldt0(xa,smndt0(xb))
| sdtasdt0(xq,X2) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ic0mwv7g/input.p',i_0_57) ).
cnf(i_0_48,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ic0mwv7g/input.p',i_0_48) ).
cnf(i_0_6,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ic0mwv7g/input.p',i_0_6) ).
cnf(i_0_46,hypothesis,
aInteger0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ic0mwv7g/input.p',i_0_46) ).
cnf(i_0_35,hypothesis,
aInteger0(xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ic0mwv7g/input.p',i_0_35) ).
cnf(i_0_47,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ic0mwv7g/input.p',i_0_47) ).
cnf(i_0_37,hypothesis,
aInteger0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ic0mwv7g/input.p',i_0_37) ).
cnf(c_0_65,negated_conjecture,
( sdtasdt0(xp,X1) != sdtpldt0(xa,smndt0(xb))
| sdtasdt0(xq,X2) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
i_0_57 ).
cnf(c_0_66,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
i_0_48 ).
cnf(c_0_67,negated_conjecture,
( sdtasdt0(xp,X1) != sdtasdt0(xp,sdtasdt0(xq,xm))
| sdtasdt0(xq,X2) != sdtasdt0(xp,sdtasdt0(xq,xm))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66]) ).
cnf(c_0_68,negated_conjecture,
( sdtasdt0(xq,X1) != sdtasdt0(xp,sdtasdt0(xq,xm))
| ~ aInteger0(sdtasdt0(xq,xm))
| ~ aInteger0(X1) ),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_69,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_6 ).
cnf(c_0_70,hypothesis,
aInteger0(xm),
i_0_46 ).
cnf(c_0_71,hypothesis,
aInteger0(xq),
i_0_35 ).
cnf(c_0_72,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)),
i_0_47 ).
cnf(c_0_73,plain,
( sdtasdt0(xq,X1) != sdtasdt0(xp,sdtasdt0(xq,xm))
| ~ aInteger0(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_74,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_72,c_0_66]) ).
cnf(c_0_75,hypothesis,
~ aInteger0(sdtasdt0(xp,xm)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_76,hypothesis,
aInteger0(xp),
i_0_37 ).
cnf(c_0_77,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_69]),c_0_70]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM436+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 08:47:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.33/2.35 # ENIGMATIC: Solved by autoschedule:
% 7.33/2.35 # No SInE strategy applied
% 7.33/2.35 # Trying AutoSched0 for 150 seconds
% 7.33/2.35 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.33/2.35 # and selection function SelectNewComplexAHP.
% 7.33/2.35 #
% 7.33/2.35 # Preprocessing time : 0.023 s
% 7.33/2.35 # Presaturation interreduction done
% 7.33/2.35
% 7.33/2.35 # Proof found!
% 7.33/2.35 # SZS status Theorem
% 7.33/2.35 # SZS output start CNFRefutation
% See solution above
% 7.33/2.35 # Training examples: 0 positive, 0 negative
% 7.33/2.35
% 7.33/2.35 # -------------------------------------------------
% 7.33/2.35 # User time : 0.029 s
% 7.33/2.35 # System time : 0.008 s
% 7.33/2.35 # Total time : 0.037 s
% 7.33/2.35 # Maximum resident set size: 7120 pages
% 7.33/2.35
%------------------------------------------------------------------------------