TSTP Solution File: NUM561+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM561+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:37:22 EDT 2022
% Result : Theorem 6.62s 2.30s
% Output : CNFRefutation 6.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 7 unt; 0 nHn; 15 RR)
% Number of literals : 34 ( 4 equ; 21 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_129,plain,
( aElementOf0(X1,X2)
| X2 != sdtlcdtrc0(X3,X4)
| sdtlpdtrp0(X3,X5) != X1
| ~ aFunction0(X3)
| ~ aElementOf0(X5,X4)
| ~ aSubsetOf0(X4,szDzozmdt0(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qk7jeuqb/lgb.p',i_0_129) ).
cnf(i_0_17,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qk7jeuqb/lgb.p',i_0_17) ).
cnf(i_0_116,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qk7jeuqb/lgb.p',i_0_116) ).
cnf(i_0_134,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qk7jeuqb/lgb.p',i_0_134) ).
cnf(i_0_133,hypothesis,
aFunction0(xF),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qk7jeuqb/lgb.p',i_0_133) ).
cnf(i_0_135,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qk7jeuqb/lgb.p',i_0_135) ).
cnf(c_0_142,plain,
( aElementOf0(X1,X2)
| X2 != sdtlcdtrc0(X3,X4)
| sdtlpdtrp0(X3,X5) != X1
| ~ aFunction0(X3)
| ~ aElementOf0(X5,X4)
| ~ aSubsetOf0(X4,szDzozmdt0(X3)) ),
i_0_129 ).
cnf(c_0_143,plain,
( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,X3))
| ~ aSubsetOf0(X3,szDzozmdt0(X1))
| ~ aFunction0(X1)
| ~ aElementOf0(X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_142])]) ).
cnf(c_0_144,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
i_0_17 ).
cnf(c_0_145,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
i_0_116 ).
cnf(c_0_146,plain,
( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,szDzozmdt0(X1)))
| ~ aFunction0(X1)
| ~ aElementOf0(X2,szDzozmdt0(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_145]) ).
cnf(c_0_147,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
i_0_134 ).
cnf(c_0_148,hypothesis,
aFunction0(xF),
i_0_133 ).
cnf(c_0_149,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
i_0_135 ).
cnf(c_0_150,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148])]),c_0_149]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM561+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 18:49:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 6.62/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.62/2.30 # No SInE strategy applied
% 6.62/2.30 # Trying AutoSched0 for 150 seconds
% 6.62/2.30 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 6.62/2.30 # and selection function SelectNewComplexAHPNS.
% 6.62/2.30 #
% 6.62/2.30 # Preprocessing time : 0.024 s
% 6.62/2.30
% 6.62/2.30 # Proof found!
% 6.62/2.30 # SZS status Theorem
% 6.62/2.30 # SZS output start CNFRefutation
% See solution above
% 6.62/2.30 # Training examples: 0 positive, 0 negative
% 6.62/2.30
% 6.62/2.30 # -------------------------------------------------
% 6.62/2.30 # User time : 0.026 s
% 6.62/2.30 # System time : 0.006 s
% 6.62/2.30 # Total time : 0.032 s
% 6.62/2.30 # Maximum resident set size: 7124 pages
% 6.62/2.30
%------------------------------------------------------------------------------