TSTP Solution File: LAT382+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LAT382+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:45 EDT 2022
% Result : Theorem 7.70s 2.27s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 17 unt; 0 nHn; 25 RR)
% Number of literals : 41 ( 4 equ; 18 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_46,hypothesis,
( sdtlseqdt0(X1,xu)
| ~ aLowerBoundOfIn0(X1,xS,xT) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_46) ).
cnf(i_0_41,hypothesis,
aLowerBoundOfIn0(xv,xS,xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_41) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_3) ).
cnf(i_0_43,hypothesis,
aElementOf0(xv,xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_43) ).
cnf(i_0_33,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_33) ).
cnf(i_0_51,hypothesis,
aElementOf0(xu,xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_51) ).
cnf(i_0_38,hypothesis,
( sdtlseqdt0(X1,xv)
| ~ aLowerBoundOfIn0(X1,xS,xT) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_38) ).
cnf(i_0_49,hypothesis,
aLowerBoundOfIn0(xu,xS,xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_49) ).
cnf(i_0_12,plain,
( X1 = X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_12) ).
cnf(i_0_52,negated_conjecture,
xv != xu,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mngoz7j3/input.p',i_0_52) ).
cnf(c_0_63,hypothesis,
( sdtlseqdt0(X1,xu)
| ~ aLowerBoundOfIn0(X1,xS,xT) ),
i_0_46 ).
cnf(c_0_64,hypothesis,
aLowerBoundOfIn0(xv,xS,xT),
i_0_41 ).
cnf(c_0_65,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_66,hypothesis,
aElementOf0(xv,xT),
i_0_43 ).
cnf(c_0_67,hypothesis,
aSet0(xT),
i_0_33 ).
cnf(c_0_68,hypothesis,
aElementOf0(xu,xT),
i_0_51 ).
cnf(c_0_69,hypothesis,
( sdtlseqdt0(X1,xv)
| ~ aLowerBoundOfIn0(X1,xS,xT) ),
i_0_38 ).
cnf(c_0_70,hypothesis,
aLowerBoundOfIn0(xu,xS,xT),
i_0_49 ).
cnf(c_0_71,plain,
( X1 = X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_12 ).
cnf(c_0_72,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_73,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_74,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_68]),c_0_67])]) ).
cnf(c_0_75,hypothesis,
sdtlseqdt0(xu,xv),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
xv != xu,
i_0_52 ).
cnf(c_0_77,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_74]),c_0_75])]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT382+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n029.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 : Wed Jun 29 12:19:54 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.70/2.27 # ENIGMATIC: Solved by autoschedule:
% 7.70/2.27 # No SInE strategy applied
% 7.70/2.27 # Trying AutoSched0 for 150 seconds
% 7.70/2.27 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.70/2.27 # and selection function SelectCQArNTNpEqFirst.
% 7.70/2.27 #
% 7.70/2.27 # Preprocessing time : 0.019 s
% 7.70/2.27 # Presaturation interreduction done
% 7.70/2.27
% 7.70/2.27 # Proof found!
% 7.70/2.27 # SZS status Theorem
% 7.70/2.27 # SZS output start CNFRefutation
% See solution above
% 7.70/2.27 # Training examples: 0 positive, 0 negative
% 7.70/2.27
% 7.70/2.27 # -------------------------------------------------
% 7.70/2.27 # User time : 0.019 s
% 7.70/2.27 # System time : 0.008 s
% 7.70/2.27 # Total time : 0.028 s
% 7.70/2.27 # Maximum resident set size: 7124 pages
% 7.70/2.27
%------------------------------------------------------------------------------