TSTP Solution File: GEO449+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO449+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 11.61s 6.22s
% Output : CNFRefutation 11.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 11 unt; 0 nHn; 6 RR)
% Number of literals : 17 ( 11 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 14 con; 0-2 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5086,plain,
s(cart(real,X1),i(s(fun(cart(real,X1),cart(real,X1)),i(s(fun(real,fun(cart(real,X1),cart(real,X1))),r_),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(real,X1),X2))) = s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fx2fa_xo/lgb.p',i_0_5086) ).
cnf(i_0_3465,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fx2fa_xo/lgb.p',i_0_3465) ).
cnf(i_0_390,negated_conjecture,
s(cart(real,esk61_0),i(s(fun(cart(real,esk60_0),cart(real,esk61_0)),i(s(fun(cart(real,esk59_0),fun(cart(real,esk60_0),cart(real,esk61_0))),esk62_0),s(cart(real,esk59_0),esk63_0))),s(cart(real,esk60_0),i(s(fun(num,cart(real,esk60_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))) != s(cart(real,esk61_0),i(s(fun(num,cart(real,esk61_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fx2fa_xo/lgb.p',i_0_390) ).
cnf(i_0_388,plain,
( s(cart(real,X1),i(s(fun(cart(real,X2),cart(real,X1)),i(s(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),X4),s(cart(real,X3),X5))),s(cart(real,X2),i(s(fun(cart(real,X2),cart(real,X2)),i(s(fun(real,fun(cart(real,X2),cart(real,X2))),r_),s(real,X6))),s(cart(real,X2),X7))))) = s(cart(real,X1),i(s(fun(cart(real,X1),cart(real,X1)),i(s(fun(real,fun(cart(real,X1),cart(real,X1))),r_),s(real,X6))),s(cart(real,X1),i(s(fun(cart(real,X2),cart(real,X1)),i(s(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),X4),s(cart(real,X3),X5))),s(cart(real,X2),X7)))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),bool),bilinear),s(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),X4)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fx2fa_xo/lgb.p',i_0_388) ).
cnf(i_0_391,negated_conjecture,
p(s(bool,i(s(fun(fun(cart(real,esk59_0),fun(cart(real,esk60_0),cart(real,esk61_0))),bool),bilinear),s(fun(cart(real,esk59_0),fun(cart(real,esk60_0),cart(real,esk61_0))),esk62_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fx2fa_xo/lgb.p',i_0_391) ).
cnf(c_0_5092,plain,
s(cart(real,X1),i(s(fun(cart(real,X1),cart(real,X1)),i(s(fun(real,fun(cart(real,X1),cart(real,X1))),r_),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(cart(real,X1),X2))) = s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))),
i_0_5086 ).
cnf(c_0_5093,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
i_0_3465 ).
cnf(c_0_5094,negated_conjecture,
s(cart(real,esk61_0),i(s(fun(cart(real,esk60_0),cart(real,esk61_0)),i(s(fun(cart(real,esk59_0),fun(cart(real,esk60_0),cart(real,esk61_0))),esk62_0),s(cart(real,esk59_0),esk63_0))),s(cart(real,esk60_0),i(s(fun(num,cart(real,esk60_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))) != s(cart(real,esk61_0),i(s(fun(num,cart(real,esk61_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))),
i_0_390 ).
cnf(c_0_5095,plain,
( s(cart(real,X1),i(s(fun(cart(real,X2),cart(real,X1)),i(s(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),X4),s(cart(real,X3),X5))),s(cart(real,X2),i(s(fun(cart(real,X2),cart(real,X2)),i(s(fun(real,fun(cart(real,X2),cart(real,X2))),r_),s(real,X6))),s(cart(real,X2),X7))))) = s(cart(real,X1),i(s(fun(cart(real,X1),cart(real,X1)),i(s(fun(real,fun(cart(real,X1),cart(real,X1))),r_),s(real,X6))),s(cart(real,X1),i(s(fun(cart(real,X2),cart(real,X1)),i(s(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),X4),s(cart(real,X3),X5))),s(cart(real,X2),X7)))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),bool),bilinear),s(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),X4)))) ),
i_0_388 ).
cnf(c_0_5096,plain,
s(cart(real,X1),i(s(fun(cart(real,X1),cart(real,X1)),i(s(fun(real,fun(cart(real,X1),cart(real,X1))),r_),s(real,i(s(fun(num,real),realu_ofu_num),s(num,u_0))))),s(cart(real,X1),X2))) = s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,u_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5092,c_0_5093]),c_0_5093]) ).
cnf(c_0_5097,negated_conjecture,
s(cart(real,esk61_0),i(s(fun(cart(real,esk60_0),cart(real,esk61_0)),i(s(fun(cart(real,esk59_0),fun(cart(real,esk60_0),cart(real,esk61_0))),esk62_0),s(cart(real,esk59_0),esk63_0))),s(cart(real,esk60_0),i(s(fun(num,cart(real,esk60_0)),vec),s(num,u_0))))) != s(cart(real,esk61_0),i(s(fun(num,cart(real,esk61_0)),vec),s(num,u_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5094,c_0_5093]),c_0_5093]) ).
cnf(c_0_5098,plain,
( s(cart(real,X1),i(s(fun(cart(real,X2),cart(real,X1)),i(s(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),X4),s(cart(real,X3),X5))),s(cart(real,X2),i(s(fun(num,cart(real,X2)),vec),s(num,u_0))))) = s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,u_0)))
| ~ p(s(bool,i(s(fun(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),bool),bilinear),s(fun(cart(real,X3),fun(cart(real,X2),cart(real,X1))),X4)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5095,c_0_5096]),c_0_5096]) ).
cnf(c_0_5099,negated_conjecture,
p(s(bool,i(s(fun(fun(cart(real,esk59_0),fun(cart(real,esk60_0),cart(real,esk61_0))),bool),bilinear),s(fun(cart(real,esk59_0),fun(cart(real,esk60_0),cart(real,esk61_0))),esk62_0)))),
i_0_391 ).
cnf(c_0_5100,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5097,c_0_5098]),c_0_5099])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO449+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 : n015.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 : Fri Jun 17 19:50:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.63/0.81 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.63/0.81 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.63/0.81 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.63/0.81 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.61/6.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.61/6.22 # No SInE strategy applied
% 11.61/6.22 # Trying AutoSched0 for 148 seconds
% 11.61/6.22 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 11.61/6.22 # and selection function SelectComplexExceptUniqMaxHorn.
% 11.61/6.22 #
% 11.61/6.22 # Preprocessing time : 0.014 s
% 11.61/6.22 # Presaturation interreduction done
% 11.61/6.22
% 11.61/6.22 # Proof found!
% 11.61/6.22 # SZS status Theorem
% 11.61/6.22 # SZS output start CNFRefutation
% See solution above
% 11.61/6.22 # Training examples: 0 positive, 0 negative
% 11.61/6.22
% 11.61/6.22 # -------------------------------------------------
% 11.61/6.22 # User time : 0.019 s
% 11.61/6.22 # System time : 0.003 s
% 11.61/6.22 # Total time : 0.023 s
% 11.61/6.22 # Maximum resident set size: 7456 pages
% 11.61/6.22
%------------------------------------------------------------------------------