TSTP Solution File: LAT381+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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 7.15s 2.30s
% Output : CNFRefutation 7.15s
% 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_45,hypothesis,
( sdtlseqdt0(xu,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_45) ).
cnf(i_0_40,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_40) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_3) ).
cnf(i_0_50,hypothesis,
aElementOf0(xu,xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_50) ).
cnf(i_0_32,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_32) ).
cnf(i_0_43,hypothesis,
aElementOf0(xv,xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_43) ).
cnf(i_0_37,hypothesis,
( sdtlseqdt0(xv,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_37) ).
cnf(i_0_48,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_48) ).
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-m6o20tmo/lgb.p',i_0_12) ).
cnf(i_0_51,negated_conjecture,
xv != xu,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6o20tmo/lgb.p',i_0_51) ).
cnf(c_0_62,hypothesis,
( sdtlseqdt0(xu,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
i_0_45 ).
cnf(c_0_63,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
i_0_40 ).
cnf(c_0_64,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_65,hypothesis,
aElementOf0(xu,xT),
i_0_50 ).
cnf(c_0_66,hypothesis,
aSet0(xT),
i_0_32 ).
cnf(c_0_67,hypothesis,
aElementOf0(xv,xT),
i_0_43 ).
cnf(c_0_68,hypothesis,
( sdtlseqdt0(xv,X1)
| ~ aUpperBoundOfIn0(X1,xS,xT) ),
i_0_37 ).
cnf(c_0_69,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
i_0_48 ).
cnf(c_0_70,plain,
( X1 = X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_12 ).
cnf(c_0_71,hypothesis,
sdtlseqdt0(xu,xv),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_72,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_73,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_67]),c_0_66])]) ).
cnf(c_0_74,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
xv != xu,
i_0_51 ).
cnf(c_0_76,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_70,c_0_71]),c_0_72]),c_0_73]),c_0_74])]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n004.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 Jun 28 18:53:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 7.15/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.15/2.30 # No SInE strategy applied
% 7.15/2.30 # Trying AutoSched0 for 150 seconds
% 7.15/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 7.15/2.30 # and selection function PSelectNewComplexAHP.
% 7.15/2.30 #
% 7.15/2.30 # Preprocessing time : 0.023 s
% 7.15/2.30 # Presaturation interreduction done
% 7.15/2.30
% 7.15/2.30 # Proof found!
% 7.15/2.30 # SZS status Theorem
% 7.15/2.30 # SZS output start CNFRefutation
% See solution above
% 7.15/2.30 # Training examples: 0 positive, 0 negative
% 7.15/2.30
% 7.15/2.30 # -------------------------------------------------
% 7.15/2.30 # User time : 0.024 s
% 7.15/2.30 # System time : 0.008 s
% 7.15/2.30 # Total time : 0.032 s
% 7.15/2.30 # Maximum resident set size: 7128 pages
% 7.15/2.30
%------------------------------------------------------------------------------