TSTP Solution File: LAT382+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LAT382+1 : 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 : Sun Jul 17 04:30:44 EDT 2022
% Result : Theorem 8.55s 2.54s
% Output : CNFRefutation 8.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 19 unt; 0 nHn; 31 RR)
% Number of literals : 65 ( 4 equ; 37 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
( aLowerBoundOfIn0(X1,X2,X3)
| ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aInfimumOfIn0(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_25) ).
cnf(i_0_36,hypothesis,
aInfimumOfIn0(xu,xS,xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_36) ).
cnf(i_0_34,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_34) ).
cnf(i_0_33,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_33) ).
cnf(i_0_24,plain,
( sdtlseqdt0(X1,X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X4,X3)
| ~ aLowerBoundOfIn0(X1,X4,X3)
| ~ aInfimumOfIn0(X2,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_24) ).
cnf(i_0_26,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X3,X2)
| ~ aInfimumOfIn0(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_26) ).
cnf(i_0_35,hypothesis,
aInfimumOfIn0(xv,xS,xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_35) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_3) ).
cnf(i_0_12,plain,
( X1 = X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_12) ).
cnf(i_0_37,negated_conjecture,
xv != xu,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0wpngeu/lgb.p',i_0_37) ).
cnf(c_0_48,plain,
( aLowerBoundOfIn0(X1,X2,X3)
| ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aInfimumOfIn0(X1,X2,X3) ),
i_0_25 ).
cnf(c_0_49,hypothesis,
aInfimumOfIn0(xu,xS,xT),
i_0_36 ).
cnf(c_0_50,hypothesis,
aSubsetOf0(xS,xT),
i_0_34 ).
cnf(c_0_51,hypothesis,
aSet0(xT),
i_0_33 ).
cnf(c_0_52,plain,
( sdtlseqdt0(X1,X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X4,X3)
| ~ aLowerBoundOfIn0(X1,X4,X3)
| ~ aInfimumOfIn0(X2,X4,X3) ),
i_0_24 ).
cnf(c_0_53,hypothesis,
aLowerBoundOfIn0(xu,xS,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_54,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X3,X2)
| ~ aInfimumOfIn0(X1,X3,X2) ),
i_0_26 ).
cnf(c_0_55,hypothesis,
aInfimumOfIn0(xv,xS,xT),
i_0_35 ).
cnf(c_0_56,plain,
( sdtlseqdt0(xu,X1)
| ~ aInfimumOfIn0(X1,xS,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_50]),c_0_51])]) ).
cnf(c_0_57,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_58,hypothesis,
aElementOf0(xu,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_59,hypothesis,
aElementOf0(xv,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_50]),c_0_51])]) ).
cnf(c_0_60,hypothesis,
aLowerBoundOfIn0(xv,xS,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_55]),c_0_50]),c_0_51])]) ).
cnf(c_0_61,plain,
( X1 = X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_12 ).
cnf(c_0_62,hypothesis,
sdtlseqdt0(xu,xv),
inference(spm,[status(thm)],[c_0_56,c_0_55]) ).
cnf(c_0_63,plain,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_51])]) ).
cnf(c_0_64,plain,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_59]),c_0_51])]) ).
cnf(c_0_65,negated_conjecture,
xv != xu,
i_0_37 ).
cnf(c_0_66,plain,
( sdtlseqdt0(xv,X1)
| ~ aInfimumOfIn0(X1,xS,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_60]),c_0_50]),c_0_51])]) ).
cnf(c_0_67,plain,
~ sdtlseqdt0(xv,xu),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64])]),c_0_65]) ).
cnf(c_0_68,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_49]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT382+1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n007.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 Jun 28 18:55:08 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.55/2.54 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.55/2.54 # No SInE strategy applied
% 8.55/2.54 # Trying AutoSched0 for 150 seconds
% 8.55/2.54 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% 8.55/2.54 # and selection function SelectComplexG.
% 8.55/2.54 #
% 8.55/2.54 # Preprocessing time : 0.023 s
% 8.55/2.54
% 8.55/2.54 # Proof found!
% 8.55/2.54 # SZS status Theorem
% 8.55/2.54 # SZS output start CNFRefutation
% See solution above
% 8.55/2.54 # Training examples: 0 positive, 0 negative
% 8.55/2.54
% 8.55/2.54 # -------------------------------------------------
% 8.55/2.54 # User time : 0.024 s
% 8.55/2.54 # System time : 0.009 s
% 8.55/2.54 # Total time : 0.034 s
% 8.55/2.54 # Maximum resident set size: 7120 pages
% 8.55/2.54
%------------------------------------------------------------------------------