TSTP Solution File: NUM435+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM435+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:58 EDT 2022
% Result : Theorem 4.62s 2.23s
% Output : CNFRefutation 4.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 23 unt; 0 nHn; 31 RR)
% Number of literals : 49 ( 20 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_42,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_42) ).
cnf(i_0_45,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_45) ).
cnf(i_0_13,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_13) ).
cnf(i_0_43,hypothesis,
aInteger0(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_43) ).
cnf(i_0_35,hypothesis,
aInteger0(xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_35) ).
cnf(i_0_37,hypothesis,
aInteger0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_37) ).
cnf(i_0_46,hypothesis,
aInteger0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_46) ).
cnf(i_0_14,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_14) ).
cnf(i_0_6,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_6) ).
cnf(i_0_47,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yc40gfnx/lgb.p',i_0_47) ).
cnf(c_0_58,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb)),
i_0_42 ).
cnf(c_0_59,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
i_0_45 ).
cnf(c_0_60,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtasdt0(sdtasdt0(xp,xq),xm),
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_13 ).
cnf(c_0_62,hypothesis,
aInteger0(esk2_0),
i_0_43 ).
cnf(c_0_63,hypothesis,
aInteger0(xq),
i_0_35 ).
cnf(c_0_64,hypothesis,
aInteger0(xp),
i_0_37 ).
cnf(c_0_65,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xp,sdtasdt0(xq,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63]),c_0_64])]) ).
cnf(c_0_66,hypothesis,
aInteger0(xm),
i_0_46 ).
cnf(c_0_67,plain,
sdtasdt0(xp,sdtasdt0(xq,esk2_0)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_65]),c_0_66]),c_0_63]),c_0_64])]) ).
cnf(c_0_68,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_14 ).
cnf(c_0_69,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_65,c_0_67]) ).
cnf(c_0_70,plain,
( sdtasdt0(xm,sdtasdt0(xp,xq)) = sdtasdt0(xp,sdtasdt0(xq,xm))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_66])]) ).
cnf(c_0_71,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_6 ).
cnf(c_0_72,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtpldt0(xa,smndt0(xb)),
i_0_47 ).
cnf(c_0_73,plain,
sdtasdt0(xm,sdtasdt0(xp,xq)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_63]),c_0_64])]) ).
cnf(c_0_74,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_61]),c_0_71]) ).
cnf(c_0_75,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),xm) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_72,c_0_59]) ).
cnf(c_0_76,plain,
sdtasdt0(xq,sdtasdt0(xm,xp)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_63]),c_0_64]),c_0_66])]) ).
cnf(c_0_77,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_61]),c_0_66]),c_0_63]),c_0_64])]) ).
cnf(c_0_78,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_68]),c_0_64]),c_0_66])]),c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM435+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 : Wed Jul 6 06:38:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.62/2.23 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.62/2.23 # No SInE strategy applied
% 4.62/2.23 # Trying AutoSched0 for 150 seconds
% 4.62/2.23 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 4.62/2.23 # and selection function SelectNewComplexAHP.
% 4.62/2.23 #
% 4.62/2.23 # Preprocessing time : 0.023 s
% 4.62/2.23 # Presaturation interreduction done
% 4.62/2.23
% 4.62/2.23 # Proof found!
% 4.62/2.23 # SZS status Theorem
% 4.62/2.23 # SZS output start CNFRefutation
% See solution above
% 4.62/2.23 # Training examples: 0 positive, 0 negative
% 4.62/2.23
% 4.62/2.23 # -------------------------------------------------
% 4.62/2.23 # User time : 0.049 s
% 4.62/2.23 # System time : 0.005 s
% 4.62/2.23 # Total time : 0.054 s
% 4.62/2.23 # Maximum resident set size: 7124 pages
% 4.62/2.23
%------------------------------------------------------------------------------