%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM560+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:21 EDT 2022
% Result : Theorem 9.68s 2.57s
% Output : CNFRefutation 9.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 7 unt; 3 nHn; 21 RR)
% Number of literals : 60 ( 4 equ; 38 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_123,plain,
( aElementOf0(X1,szDzozmdt0(X2))
| X3 != sdtlbdtrb0(X2,X4)
| ~ aElement0(X4)
| ~ aFunction0(X2)
| ~ aElementOf0(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3h71lahm/lgb.p',i_0_123) ).
cnf(i_0_124,plain,
( aSet0(X1)
| X1 != sdtlbdtrb0(X2,X3)
| ~ aElement0(X3)
| ~ aFunction0(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3h71lahm/lgb.p',i_0_124) ).
cnf(i_0_13,plain,
( aSubsetOf0(X1,X2)
| aElementOf0(esk2_2(X2,X1),X1)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3h71lahm/lgb.p',i_0_13) ).
cnf(i_0_12,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X2,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3h71lahm/lgb.p',i_0_12) ).
cnf(i_0_116,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3h71lahm/lgb.p',i_0_116) ).
cnf(i_0_127,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3h71lahm/lgb.p',i_0_127) ).
cnf(i_0_125,hypothesis,
aElement0(xy),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3h71lahm/lgb.p',i_0_125) ).
cnf(i_0_126,hypothesis,
aFunction0(xF),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3h71lahm/lgb.p',i_0_126) ).
cnf(c_0_136,plain,
( aElementOf0(X1,szDzozmdt0(X2))
| X3 != sdtlbdtrb0(X2,X4)
| ~ aElement0(X4)
| ~ aFunction0(X2)
| ~ aElementOf0(X1,X3) ),
i_0_123 ).
cnf(c_0_137,plain,
( aSet0(X1)
| X1 != sdtlbdtrb0(X2,X3)
| ~ aElement0(X3)
| ~ aFunction0(X2) ),
i_0_124 ).
cnf(c_0_138,plain,
( aElementOf0(X1,szDzozmdt0(X2))
| ~ aElement0(X3)
| ~ aFunction0(X2)
| ~ aElementOf0(X1,sdtlbdtrb0(X2,X3)) ),
inference(er,[status(thm)],[c_0_136]) ).
cnf(c_0_139,plain,
( aSubsetOf0(X1,X2)
| aElementOf0(esk2_2(X2,X1),X1)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
i_0_13 ).
cnf(c_0_140,plain,
( aSet0(sdtlbdtrb0(X1,X2))
| ~ aElement0(X2)
| ~ aFunction0(X1) ),
inference(er,[status(thm)],[c_0_137]) ).
cnf(c_0_141,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X2,X1),X2) ),
i_0_12 ).
cnf(c_0_142,plain,
( aElementOf0(esk2_2(X1,sdtlbdtrb0(X2,X3)),szDzozmdt0(X2))
| aSubsetOf0(sdtlbdtrb0(X2,X3),X1)
| ~ aElement0(X3)
| ~ aFunction0(X2)
| ~ aSet0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140]) ).
cnf(c_0_143,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
i_0_116 ).
cnf(c_0_144,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
i_0_127 ).
cnf(c_0_145,plain,
( aSubsetOf0(sdtlbdtrb0(X1,X2),szDzozmdt0(X1))
| ~ aElement0(X2)
| ~ aFunction0(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143]),c_0_140]) ).
cnf(c_0_146,hypothesis,
aElement0(xy),
i_0_125 ).
cnf(c_0_147,hypothesis,
aFunction0(xF),
i_0_126 ).
cnf(c_0_148,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_146]),c_0_147])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM560+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 16:46:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 9.68/2.57 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.68/2.57 # No SInE strategy applied
% 9.68/2.57 # Trying AutoSched0 for 150 seconds
% 9.68/2.57 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 9.68/2.57 # and selection function SelectNewComplexAHP.
% 9.68/2.57 #
% 9.68/2.57 # Preprocessing time : 0.024 s
% 9.68/2.57 # Presaturation interreduction done
% 9.68/2.57
% 9.68/2.57 # Proof found!
% 9.68/2.57 # SZS status Theorem
% 9.68/2.57 # SZS output start CNFRefutation
% See solution above
% 9.68/2.57 # Training examples: 0 positive, 0 negative
% 9.68/2.57
% 9.68/2.57 # -------------------------------------------------
% 9.68/2.57 # User time : 0.066 s
% 9.68/2.57 # System time : 0.008 s
% 9.68/2.57 # Total time : 0.074 s
% 9.68/2.57 # Maximum resident set size: 7124 pages
% 9.68/2.57
%------------------------------------------------------------------------------