TSTP Solution File: LAT381+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LAT381+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:43 EDT 2022
% Result : Theorem 4.08s 2.20s
% Output : CNFRefutation 4.08s
% 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_30,plain,
( aUpperBoundOfIn0(X1,X2,X3)
| ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aSupremumOfIn0(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.p',i_0_30) ).
cnf(i_0_34,hypothesis,
aSupremumOfIn0(xv,xS,xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.p',i_0_34) ).
cnf(i_0_33,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.p',i_0_33) ).
cnf(i_0_32,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.p',i_0_32) ).
cnf(i_0_29,plain,
( sdtlseqdt0(X1,X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X4,X3)
| ~ aUpperBoundOfIn0(X2,X4,X3)
| ~ aSupremumOfIn0(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.p',i_0_29) ).
cnf(i_0_31,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSupremumOfIn0(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.p',i_0_31) ).
cnf(i_0_35,hypothesis,
aSupremumOfIn0(xu,xS,xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.p',i_0_35) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.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-9qdja_0j/input.p',i_0_12) ).
cnf(i_0_36,negated_conjecture,
xv != xu,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qdja_0j/input.p',i_0_36) ).
cnf(c_0_47,plain,
( aUpperBoundOfIn0(X1,X2,X3)
| ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aSupremumOfIn0(X1,X2,X3) ),
i_0_30 ).
cnf(c_0_48,hypothesis,
aSupremumOfIn0(xv,xS,xT),
i_0_34 ).
cnf(c_0_49,hypothesis,
aSubsetOf0(xS,xT),
i_0_33 ).
cnf(c_0_50,hypothesis,
aSet0(xT),
i_0_32 ).
cnf(c_0_51,plain,
( sdtlseqdt0(X1,X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X4,X3)
| ~ aUpperBoundOfIn0(X2,X4,X3)
| ~ aSupremumOfIn0(X1,X4,X3) ),
i_0_29 ).
cnf(c_0_52,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_53,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSupremumOfIn0(X1,X3,X2) ),
i_0_31 ).
cnf(c_0_54,hypothesis,
aSupremumOfIn0(xu,xS,xT),
i_0_35 ).
cnf(c_0_55,plain,
( sdtlseqdt0(X1,xv)
| ~ aSupremumOfIn0(X1,xS,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_49]),c_0_50])]) ).
cnf(c_0_56,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_57,hypothesis,
aElementOf0(xu,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_49]),c_0_50])]) ).
cnf(c_0_58,hypothesis,
aElementOf0(xv,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_59,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_54]),c_0_49]),c_0_50])]) ).
cnf(c_0_60,plain,
( X1 = X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_12 ).
cnf(c_0_61,hypothesis,
sdtlseqdt0(xu,xv),
inference(spm,[status(thm)],[c_0_55,c_0_54]) ).
cnf(c_0_62,plain,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_50])]) ).
cnf(c_0_63,plain,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_58]),c_0_50])]) ).
cnf(c_0_64,negated_conjecture,
xv != xu,
i_0_36 ).
cnf(c_0_65,plain,
( sdtlseqdt0(X1,xu)
| ~ aSupremumOfIn0(X1,xS,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_59]),c_0_49]),c_0_50])]) ).
cnf(c_0_66,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_60,c_0_61]),c_0_62]),c_0_63])]),c_0_64]) ).
cnf(c_0_67,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_48]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LAT381+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Wed Jun 29 19:54:30 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.37 # ENIGMATIC: Selected complete mode:
% 4.08/2.20 # ENIGMATIC: Solved by autoschedule:
% 4.08/2.20 # No SInE strategy applied
% 4.08/2.20 # Trying AutoSched0 for 150 seconds
% 4.08/2.20 # AutoSched0-Mode selected heuristic G_E___207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 4.08/2.20 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.08/2.20 #
% 4.08/2.20 # Preprocessing time : 0.014 s
% 4.08/2.20 # Presaturation interreduction done
% 4.08/2.20
% 4.08/2.20 # Proof found!
% 4.08/2.20 # SZS status Theorem
% 4.08/2.20 # SZS output start CNFRefutation
% See solution above
% 4.08/2.20 # Training examples: 0 positive, 0 negative
% 4.08/2.20
% 4.08/2.20 # -------------------------------------------------
% 4.08/2.20 # User time : 0.020 s
% 4.08/2.20 # System time : 0.003 s
% 4.08/2.20 # Total time : 0.023 s
% 4.08/2.20 # Maximum resident set size: 7120 pages
% 4.08/2.20
%------------------------------------------------------------------------------