TSTP Solution File: NUM435+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM435+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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 7.55s 2.35s
% Output : CNFRefutation 7.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 14 unt; 0 nHn; 21 RR)
% Number of literals : 38 ( 12 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 : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-azbf8ud8/lgb.p',i_0_43) ).
cnf(i_0_41,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-azbf8ud8/lgb.p',i_0_41) ).
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-azbf8ud8/lgb.p',i_0_13) ).
cnf(i_0_42,hypothesis,
aInteger0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-azbf8ud8/lgb.p',i_0_42) ).
cnf(i_0_35,hypothesis,
aInteger0(xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-azbf8ud8/lgb.p',i_0_35) ).
cnf(i_0_37,hypothesis,
aInteger0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-azbf8ud8/lgb.p',i_0_37) ).
cnf(i_0_14,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-azbf8ud8/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-azbf8ud8/lgb.p',i_0_6) ).
cnf(c_0_52,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtpldt0(xa,smndt0(xb)),
i_0_43 ).
cnf(c_0_53,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
i_0_41 ).
cnf(c_0_54,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),xm) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_13 ).
cnf(c_0_56,hypothesis,
aInteger0(xm),
i_0_42 ).
cnf(c_0_57,hypothesis,
aInteger0(xq),
i_0_35 ).
cnf(c_0_58,hypothesis,
aInteger0(xp),
i_0_37 ).
cnf(c_0_59,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_14 ).
cnf(c_0_60,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_6 ).
cnf(c_0_61,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_54,c_0_55]),c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_62,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_59,c_0_55]),c_0_60]) ).
cnf(c_0_63,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xm,xq)) != 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_62]),c_0_57]),c_0_56]),c_0_58])]) ).
cnf(c_0_64,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_59]),c_0_57]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM435+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jul 7 01:05:09 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.55/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.55/2.35 # No SInE strategy applied
% 7.55/2.35 # Trying AutoSched0 for 150 seconds
% 7.55/2.35 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.55/2.35 # and selection function SelectNewComplexAHP.
% 7.55/2.35 #
% 7.55/2.35 # Preprocessing time : 0.012 s
% 7.55/2.35 # Presaturation interreduction done
% 7.55/2.35
% 7.55/2.35 # Proof found!
% 7.55/2.35 # SZS status Theorem
% 7.55/2.35 # SZS output start CNFRefutation
% See solution above
% 7.55/2.35 # Training examples: 0 positive, 0 negative
% 7.55/2.35
% 7.55/2.35 # -------------------------------------------------
% 7.55/2.35 # User time : 0.022 s
% 7.55/2.35 # System time : 0.006 s
% 7.55/2.35 # Total time : 0.028 s
% 7.55/2.35 # Maximum resident set size: 7124 pages
% 7.55/2.35
%------------------------------------------------------------------------------