TSTP Solution File: GEO456+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO456+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:49 EDT 2022
% Result : Theorem 9.04s 6.12s
% Output : CNFRefutation 9.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 14 con; 0-2 aty)
% Number of variables : 20 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4073,plain,
s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,X1))),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0z4nscny/lgb.p',i_0_4073) ).
cnf(i_0_3526,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0z4nscny/lgb.p',i_0_3526) ).
cnf(i_0_4036,plain,
s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,i(s(fun(num,real),realu_ofu_num),s(num,X1))))),s(num,X2))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),i(s(fun(num,fun(num,num)),exp0),s(num,X1))),s(num,X2))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0z4nscny/lgb.p',i_0_4036) ).
cnf(i_0_4001,plain,
s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))) = s(real,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0z4nscny/lgb.p',i_0_4001) ).
cnf(i_0_2767,negated_conjecture,
s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,esk919_0))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))) != s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk919_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0z4nscny/lgb.p',i_0_2767) ).
cnf(i_0_2761,plain,
s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X1))),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X2))))) = s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,X2))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0z4nscny/lgb.p',i_0_2761) ).
cnf(i_0_2770,plain,
s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(num,real),realu_ofu_num),s(num,X1))))) = s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,X1))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0z4nscny/lgb.p',i_0_2770) ).
cnf(c_0_4081,plain,
s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,X1))),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
i_0_4073 ).
cnf(c_0_4082,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
i_0_3526 ).
cnf(c_0_4083,plain,
s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,i(s(fun(num,real),realu_ofu_num),s(num,X1))))),s(num,X2))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),i(s(fun(num,fun(num,num)),exp0),s(num,X1))),s(num,X2))))),
i_0_4036 ).
cnf(c_0_4084,plain,
s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,X1))),s(num,u_0))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4081,c_0_4082]),c_0_4082]) ).
cnf(c_0_4085,plain,
s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))) = s(real,X1),
i_0_4001 ).
cnf(c_0_4086,negated_conjecture,
s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,esk919_0))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))) != s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk919_0))),
i_0_2767 ).
cnf(c_0_4087,plain,
s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X1))),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X2))))) = s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,X2))))),
i_0_2761 ).
cnf(c_0_4088,plain,
s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),i(s(fun(num,fun(num,num)),exp0),s(num,X1))),s(num,u_0))))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))),
inference(spm,[status(thm)],[c_0_4083,c_0_4084]) ).
cnf(c_0_4089,plain,
s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(num,real),realu_ofu_num),s(num,X1))))) = s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,X1))),
i_0_2770 ).
cnf(c_0_4090,plain,
s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,X1),
inference(rw,[status(thm)],[c_0_4085,c_0_4082]) ).
cnf(c_0_4091,negated_conjecture,
s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,esk919_0))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) != s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk919_0))),
inference(rw,[status(thm)],[c_0_4086,c_0_4082]) ).
cnf(c_0_4092,plain,
s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X1))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4087,c_0_4088]),c_0_4089]),c_0_4090]) ).
cnf(c_0_4093,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4091,c_0_4092])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO456+1 : TPTP v8.1.0. Released v7.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.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 : Sat Jun 18 12:29:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.59/0.82 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.82 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.59/0.82 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.59/0.82 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.04/6.12 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.04/6.12 # No SInE strategy applied
% 9.04/6.12 # Trying AutoSched0 for 148 seconds
% 9.04/6.12 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.04/6.12 # and selection function SelectComplexExceptUniqMaxHorn.
% 9.04/6.12 #
% 9.04/6.12 # Preprocessing time : 0.025 s
% 9.04/6.12 # Presaturation interreduction done
% 9.04/6.12
% 9.04/6.12 # Proof found!
% 9.04/6.12 # SZS status Theorem
% 9.04/6.12 # SZS output start CNFRefutation
% See solution above
% 9.04/6.12 # Training examples: 0 positive, 0 negative
% 9.04/6.12
% 9.04/6.12 # -------------------------------------------------
% 9.04/6.12 # User time : 0.054 s
% 9.04/6.12 # System time : 0.005 s
% 9.04/6.12 # Total time : 0.059 s
% 9.04/6.12 # Maximum resident set size: 7688 pages
% 9.04/6.12
%------------------------------------------------------------------------------