TSTP Solution File: COM125+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM125+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Fri Jul 15 01:07:22 EDT 2022
% Result : Theorem 7.68s 2.47s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 7 unt; 5 nHn; 7 RR)
% Number of literals : 26 ( 4 equ; 11 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 30 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_149,plain,
( visFreeVar(X1,vabs(X2,X3,veabs))
| vtcheck(vbind(X1,X4,X5),vabs(X2,X3,veabs),X6)
| X1 != X2
| ~ vtcheck(X5,vabs(X2,X3,veabs),X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2plnuqy/lgb.p',i_0_149) ).
cnf(i_0_148,plain,
( X1 = X2
| visFreeVar(X1,vabs(X2,X3,veabs))
| vtcheck(vbind(X1,X4,X5),vabs(X2,X3,veabs),X6)
| ~ vtcheck(X5,vabs(X2,X3,veabs),X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2plnuqy/lgb.p',i_0_148) ).
cnf(i_0_150,negated_conjecture,
~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vabs(esk35_0,esk36_0,veabs),esk37_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2plnuqy/lgb.p',i_0_150) ).
cnf(i_0_151,negated_conjecture,
vtcheck(esk34_0,vabs(esk35_0,esk36_0,veabs),esk37_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2plnuqy/lgb.p',i_0_151) ).
cnf(i_0_152,negated_conjecture,
~ visFreeVar(esk32_0,vabs(esk35_0,esk36_0,veabs)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_2plnuqy/lgb.p',i_0_152) ).
cnf(c_0_158,plain,
( visFreeVar(X1,vabs(X2,X3,veabs))
| vtcheck(vbind(X1,X4,X5),vabs(X2,X3,veabs),X6)
| X1 != X2
| ~ vtcheck(X5,vabs(X2,X3,veabs),X6) ),
i_0_149 ).
cnf(c_0_159,plain,
( X1 = X2
| visFreeVar(X1,vabs(X2,X3,veabs))
| vtcheck(vbind(X1,X4,X5),vabs(X2,X3,veabs),X6)
| ~ vtcheck(X5,vabs(X2,X3,veabs),X6) ),
i_0_148 ).
cnf(c_0_160,negated_conjecture,
~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vabs(esk35_0,esk36_0,veabs),esk37_0),
i_0_150 ).
cnf(c_0_161,plain,
( visFreeVar(X1,vabs(X2,X3,veabs))
| vtcheck(vbind(X1,X4,X5),vabs(X2,X3,veabs),X6)
| ~ vtcheck(X5,vabs(X2,X3,veabs),X6) ),
inference(csr,[status(thm)],[c_0_158,c_0_159]) ).
cnf(c_0_162,negated_conjecture,
vtcheck(esk34_0,vabs(esk35_0,esk36_0,veabs),esk37_0),
i_0_151 ).
cnf(c_0_163,negated_conjecture,
~ visFreeVar(esk32_0,vabs(esk35_0,esk36_0,veabs)),
i_0_152 ).
cnf(c_0_164,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_162])]),c_0_163]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM125+1 : TPTP v8.1.0. Released v6.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.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 : Thu Jun 16 18:22:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.68/2.47 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.68/2.47 # No SInE strategy applied
% 7.68/2.47 # Trying AutoSched0 for 150 seconds
% 7.68/2.47 # AutoSched0-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.68/2.47 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.68/2.47 #
% 7.68/2.47 # Preprocessing time : 0.023 s
% 7.68/2.47 # Presaturation interreduction done
% 7.68/2.47
% 7.68/2.47 # Proof found!
% 7.68/2.47 # SZS status Theorem
% 7.68/2.47 # SZS output start CNFRefutation
% See solution above
% 7.68/2.47 # Training examples: 0 positive, 0 negative
% 7.68/2.47
% 7.68/2.47 # -------------------------------------------------
% 7.68/2.47 # User time : 0.026 s
% 7.68/2.47 # System time : 0.005 s
% 7.68/2.47 # Total time : 0.031 s
% 7.68/2.47 # Maximum resident set size: 7124 pages
% 7.68/2.47
%------------------------------------------------------------------------------