TSTP Solution File: GEO446+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO446+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 : Sat Jul 16 03:45:47 EDT 2022
% Result : Theorem 13.64s 7.46s
% Output : CNFRefutation 13.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 13 unt; 7 nHn; 19 RR)
% Number of literals : 47 ( 27 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_308,plain,
( s(bool,X1) = s(bool,f0)
| s(bool,X1) = s(bool,t) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-peetll05/lgb.p',i_0_308) ).
cnf(i_0_5051,plain,
p(s(bool,t)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-peetll05/lgb.p',i_0_5051) ).
cnf(i_0_4259,plain,
~ p(s(bool,f0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-peetll05/lgb.p',i_0_4259) ).
cnf(i_0_3525,plain,
( p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3))))
| s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) != s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-peetll05/lgb.p',i_0_3525) ).
cnf(i_0_3431,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-peetll05/lgb.p',i_0_3431) ).
cnf(i_0_3531,negated_conjecture,
s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1397_0))),s(cart(real,esk1396_0),esk1398_0))) != s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1398_0))),s(cart(real,esk1396_0),esk1397_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-peetll05/lgb.p',i_0_3531) ).
cnf(i_0_3526,plain,
( s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,u_0)))))
| ~ p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-peetll05/lgb.p',i_0_3526) ).
cnf(i_0_1129,plain,
s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) = s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X3))),s(cart(real,X1),X2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-peetll05/lgb.p',i_0_1129) ).
cnf(c_0_5060,plain,
( s(bool,X1) = s(bool,f0)
| s(bool,X1) = s(bool,t) ),
i_0_308 ).
cnf(c_0_5061,plain,
p(s(bool,t)),
i_0_5051 ).
cnf(c_0_5062,plain,
( s(bool,X1) = s(bool,t)
| s(bool,X2) = s(bool,t)
| s(bool,X2) = s(bool,X1) ),
inference(spm,[status(thm)],[c_0_5060,c_0_5060]) ).
cnf(c_0_5063,plain,
( s(bool,X1) = s(bool,t)
| s(bool,X2) = s(bool,X1)
| p(s(bool,X2)) ),
inference(spm,[status(thm)],[c_0_5061,c_0_5062]) ).
cnf(c_0_5064,plain,
~ p(s(bool,f0)),
i_0_4259 ).
cnf(c_0_5065,plain,
( p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3))))
| s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) != s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) ),
i_0_3525 ).
cnf(c_0_5066,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
i_0_3431 ).
cnf(c_0_5067,negated_conjecture,
s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1397_0))),s(cart(real,esk1396_0),esk1398_0))) != s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1398_0))),s(cart(real,esk1396_0),esk1397_0))),
i_0_3531 ).
cnf(c_0_5068,plain,
( s(bool,X1) = s(bool,X2)
| p(s(bool,X1))
| p(s(bool,X2)) ),
inference(spm,[status(thm)],[c_0_5061,c_0_5063]) ).
cnf(c_0_5069,plain,
( s(bool,X1) = s(bool,t)
| ~ p(s(bool,X1)) ),
inference(spm,[status(thm)],[c_0_5064,c_0_5060]) ).
cnf(c_0_5070,plain,
( p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3))))
| s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) != s(real,i(s(fun(num,real),realu_ofu_num),s(num,u_0))) ),
inference(rw,[status(thm)],[c_0_5065,c_0_5066]) ).
cnf(c_0_5071,plain,
( s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,u_0)))))
| ~ p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3)))) ),
i_0_3526 ).
cnf(c_0_5072,negated_conjecture,
( p(s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1397_0))),s(cart(real,esk1396_0),esk1398_0))))
| p(s(bool,X1))
| s(bool,X1) != s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1398_0))),s(cart(real,esk1396_0),esk1397_0))) ),
inference(spm,[status(thm)],[c_0_5067,c_0_5068]) ).
cnf(c_0_5073,plain,
( s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3))) = s(bool,t)
| s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) != s(real,i(s(fun(num,real),realu_ofu_num),s(num,u_0))) ),
inference(spm,[status(thm)],[c_0_5069,c_0_5070]) ).
cnf(c_0_5074,plain,
s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) = s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X3))),s(cart(real,X1),X2))),
i_0_1129 ).
cnf(c_0_5075,plain,
( s(real,i(s(fun(cart(real,X1),real),i(s(fun(cart(real,X1),fun(cart(real,X1),real)),dot),s(cart(real,X1),X2))),s(cart(real,X1),X3))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,u_0)))
| ~ p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3)))) ),
inference(rw,[status(thm)],[c_0_5071,c_0_5066]) ).
cnf(c_0_5076,negated_conjecture,
( p(s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1398_0))),s(cart(real,esk1396_0),esk1397_0))))
| p(s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1397_0))),s(cart(real,esk1396_0),esk1398_0)))) ),
inference(er,[status(thm)],[c_0_5072]) ).
cnf(c_0_5077,negated_conjecture,
s(real,i(s(fun(cart(real,esk1396_0),real),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),real)),dot),s(cart(real,esk1396_0),esk1398_0))),s(cart(real,esk1396_0),esk1397_0))) != s(real,i(s(fun(num,real),realu_ofu_num),s(num,u_0))),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5067,c_0_5073]),c_0_5074]),c_0_5073]) ).
cnf(c_0_5078,plain,
p(s(bool,i(s(fun(cart(real,esk1396_0),bool),i(s(fun(cart(real,esk1396_0),fun(cart(real,esk1396_0),bool)),orthogonal),s(cart(real,esk1396_0),esk1398_0))),s(cart(real,esk1396_0),esk1397_0)))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5075,c_0_5076]),c_0_5074]),c_0_5077]) ).
cnf(c_0_5079,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5075,c_0_5078]),c_0_5077]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO446+1 : TPTP v8.1.0. Released v7.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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.18/0.33 % CPULimit : 300
% 0.18/0.33 % WCLimit : 600
% 0.18/0.33 % DateTime : Sat Jun 18 07:20:59 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.59/0.79 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.59/0.79 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.59/0.79 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.59/0.79 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.64/7.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.64/7.46 # No SInE strategy applied
% 13.64/7.46 # Trying AutoSched0 for 148 seconds
% 13.64/7.46 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 13.64/7.46 # and selection function SelectComplexExceptUniqMaxHorn.
% 13.64/7.46 #
% 13.64/7.46 # Preprocessing time : 0.023 s
% 13.64/7.46 # Presaturation interreduction done
% 13.64/7.46
% 13.64/7.46 # Proof found!
% 13.64/7.46 # SZS status Theorem
% 13.64/7.46 # SZS output start CNFRefutation
% See solution above
% 13.64/7.46 # Training examples: 0 positive, 0 negative
% 13.64/7.46
% 13.64/7.46 # -------------------------------------------------
% 13.64/7.46 # User time : 0.107 s
% 13.64/7.46 # System time : 0.006 s
% 13.64/7.46 # Total time : 0.113 s
% 13.64/7.46 # Maximum resident set size: 7128 pages
% 13.64/7.46
%------------------------------------------------------------------------------