TSTP Solution File: LAT385+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LAT385+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:46 EDT 2022
% Result : Theorem 7.57s 2.31s
% Output : CNFRefutation 7.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 8 unt; 3 nHn; 17 RR)
% Number of literals : 30 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 10 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_63,hypothesis,
( epred1_1(X1)
| aElementOf0(esk12_1(X1),X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2c7nr08a/lgb.p',i_0_63) ).
cnf(i_0_83,hypothesis,
aSet0(xP),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2c7nr08a/lgb.p',i_0_83) ).
cnf(i_0_104,plain,
( aInfimumOfIn0(esk16_1(X1),X1,xU)
| ~ epred1_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2c7nr08a/lgb.p',i_0_104) ).
cnf(i_0_84,negated_conjecture,
~ aInfimumOfIn0(X1,xP,xU),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2c7nr08a/lgb.p',i_0_84) ).
cnf(i_0_82,hypothesis,
( aElementOf0(X1,xU)
| ~ aElementOf0(X1,xP) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2c7nr08a/lgb.p',i_0_82) ).
cnf(i_0_62,hypothesis,
( epred1_1(X1)
| ~ aSet0(X1)
| ~ aElementOf0(esk12_1(X1),xU) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2c7nr08a/lgb.p',i_0_62) ).
cnf(c_0_111,hypothesis,
( epred1_1(X1)
| aElementOf0(esk12_1(X1),X1)
| ~ aSet0(X1) ),
i_0_63 ).
cnf(c_0_112,hypothesis,
aSet0(xP),
i_0_83 ).
cnf(c_0_113,plain,
( aInfimumOfIn0(esk16_1(X1),X1,xU)
| ~ epred1_1(X1) ),
i_0_104 ).
cnf(c_0_114,hypothesis,
( aElementOf0(esk12_1(xP),xP)
| epred1_1(xP) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_115,negated_conjecture,
~ aInfimumOfIn0(X1,xP,xU),
i_0_84 ).
cnf(c_0_116,hypothesis,
( aElementOf0(X1,xU)
| ~ aElementOf0(X1,xP) ),
i_0_82 ).
cnf(c_0_117,plain,
aElementOf0(esk12_1(xP),xP),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115]) ).
cnf(c_0_118,hypothesis,
( epred1_1(X1)
| ~ aSet0(X1)
| ~ aElementOf0(esk12_1(X1),xU) ),
i_0_62 ).
cnf(c_0_119,hypothesis,
aElementOf0(esk12_1(xP),xU),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_120,hypothesis,
epred1_1(xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_112])]) ).
cnf(c_0_121,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_120]),c_0_115]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT385+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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 : Wed Jun 29 17:30:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.57/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.57/2.31 # No SInE strategy applied
% 7.57/2.31 # Trying AutoSched0 for 150 seconds
% 7.57/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S085I
% 7.57/2.31 # and selection function SelectCQArNp.
% 7.57/2.31 #
% 7.57/2.31 # Preprocessing time : 0.023 s
% 7.57/2.31 # Presaturation interreduction done
% 7.57/2.31
% 7.57/2.31 # Proof found!
% 7.57/2.31 # SZS status Theorem
% 7.57/2.31 # SZS output start CNFRefutation
% See solution above
% 7.57/2.31 # Training examples: 0 positive, 0 negative
% 7.57/2.31
% 7.57/2.31 # -------------------------------------------------
% 7.57/2.31 # User time : 0.024 s
% 7.57/2.31 # System time : 0.005 s
% 7.57/2.31 # Total time : 0.029 s
% 7.57/2.31 # Maximum resident set size: 7120 pages
% 7.57/2.31
%------------------------------------------------------------------------------