TSTP Solution File: GEO489+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO489+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:58 EDT 2022
% Result : Theorem 13.71s 8.33s
% Output : CNFRefutation 13.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 13 unt; 0 nHn; 13 RR)
% Number of literals : 23 ( 13 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 16 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4916,plain,
s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),i(s(fun(bool,fun(real,fun(real,real))),cond),s(bool,i(s(fun(fun(X1,X1),bool),evenperm),s(fun(X1,X1),X2))))),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,i(s(fun(real,real),realu_neg),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,i(s(fun(fun(X1,X1),real),sign),s(fun(X1,X1),X2))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-opff3l5l/lgb.p',i_0_4916) ).
cnf(i_0_3864,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-opff3l5l/lgb.p',i_0_3864) ).
cnf(i_0_1459,plain,
( s(bool,i(s(fun(fun(X1,X1),bool),evenperm),s(fun(X1,X1),i(s(fun(fun(X1,X1),fun(X1,X1)),inverse),s(fun(X1,X1),X2))))) = s(bool,i(s(fun(fun(X1,X1),bool),evenperm),s(fun(X1,X1),X2)))
| ~ p(s(bool,i(s(fun(fun(X1,X1),bool),permutation),s(fun(X1,X1),X2)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-opff3l5l/lgb.p',i_0_1459) ).
cnf(i_0_1399,plain,
( s(bool,X1) = s(bool,t)
| ~ p(s(bool,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-opff3l5l/lgb.p',i_0_1399) ).
cnf(i_0_4919,negated_conjecture,
p(s(bool,i(s(fun(fun(esk1871_0,esk1871_0),bool),permutation),s(fun(esk1871_0,esk1871_0),esk1872_0)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-opff3l5l/lgb.p',i_0_4919) ).
cnf(i_0_4918,negated_conjecture,
s(real,i(s(fun(fun(esk1871_0,esk1871_0),real),sign),s(fun(esk1871_0,esk1871_0),i(s(fun(fun(esk1871_0,esk1871_0),fun(esk1871_0,esk1871_0)),inverse),s(fun(esk1871_0,esk1871_0),esk1872_0))))) != s(real,i(s(fun(fun(esk1871_0,esk1871_0),real),sign),s(fun(esk1871_0,esk1871_0),esk1872_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-opff3l5l/lgb.p',i_0_4918) ).
cnf(i_0_5973,plain,
p(s(bool,t)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-opff3l5l/lgb.p',i_0_5973) ).
cnf(c_0_5981,plain,
s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),i(s(fun(bool,fun(real,fun(real,real))),cond),s(bool,i(s(fun(fun(X1,X1),bool),evenperm),s(fun(X1,X1),X2))))),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,i(s(fun(real,real),realu_neg),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,i(s(fun(fun(X1,X1),real),sign),s(fun(X1,X1),X2))),
i_0_4916 ).
cnf(c_0_5982,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
i_0_3864 ).
cnf(c_0_5983,plain,
s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),i(s(fun(bool,fun(real,fun(real,real))),cond),s(bool,i(s(fun(fun(X1,X1),bool),evenperm),s(fun(X1,X1),X2))))),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),s(real,i(s(fun(real,real),realu_neg),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))) = s(real,i(s(fun(fun(X1,X1),real),sign),s(fun(X1,X1),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5981,c_0_5982]),c_0_5982]) ).
cnf(c_0_5984,plain,
( s(bool,i(s(fun(fun(X1,X1),bool),evenperm),s(fun(X1,X1),i(s(fun(fun(X1,X1),fun(X1,X1)),inverse),s(fun(X1,X1),X2))))) = s(bool,i(s(fun(fun(X1,X1),bool),evenperm),s(fun(X1,X1),X2)))
| ~ p(s(bool,i(s(fun(fun(X1,X1),bool),permutation),s(fun(X1,X1),X2)))) ),
i_0_1459 ).
cnf(c_0_5985,plain,
( s(bool,X1) = s(bool,t)
| ~ p(s(bool,X1)) ),
i_0_1399 ).
cnf(c_0_5986,negated_conjecture,
p(s(bool,i(s(fun(fun(esk1871_0,esk1871_0),bool),permutation),s(fun(esk1871_0,esk1871_0),esk1872_0)))),
i_0_4919 ).
cnf(c_0_5987,negated_conjecture,
s(real,i(s(fun(fun(esk1871_0,esk1871_0),real),sign),s(fun(esk1871_0,esk1871_0),i(s(fun(fun(esk1871_0,esk1871_0),fun(esk1871_0,esk1871_0)),inverse),s(fun(esk1871_0,esk1871_0),esk1872_0))))) != s(real,i(s(fun(fun(esk1871_0,esk1871_0),real),sign),s(fun(esk1871_0,esk1871_0),esk1872_0))),
i_0_4918 ).
cnf(c_0_5988,plain,
( s(real,i(s(fun(fun(X1,X1),real),sign),s(fun(X1,X1),i(s(fun(fun(X1,X1),fun(X1,X1)),inverse),s(fun(X1,X1),X2))))) = s(real,i(s(fun(fun(X1,X1),real),sign),s(fun(X1,X1),X2)))
| ~ p(s(bool,i(s(fun(fun(X1,X1),bool),permutation),s(fun(X1,X1),X2)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5983,c_0_5984]),c_0_5983]) ).
cnf(c_0_5989,negated_conjecture,
s(bool,i(s(fun(fun(esk1871_0,esk1871_0),bool),permutation),s(fun(esk1871_0,esk1871_0),esk1872_0))) = s(bool,t),
inference(spm,[status(thm)],[c_0_5985,c_0_5986]) ).
cnf(c_0_5990,plain,
p(s(bool,t)),
i_0_5973 ).
cnf(c_0_5991,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5987,c_0_5988]),c_0_5989]),c_0_5990])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO489+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 : n004.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 10:15:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.69/0.88 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.69/0.88 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.69/0.88 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.69/0.88 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.71/8.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.71/8.33 # No SInE strategy applied
% 13.71/8.33 # Trying AutoSched0 for 147 seconds
% 13.71/8.33 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 13.71/8.33 # and selection function SelectComplexExceptUniqMaxHorn.
% 13.71/8.33 #
% 13.71/8.33 # Preprocessing time : 0.013 s
% 13.71/8.33 # Presaturation interreduction done
% 13.71/8.33
% 13.71/8.33 # Proof found!
% 13.71/8.33 # SZS status Theorem
% 13.71/8.33 # SZS output start CNFRefutation
% See solution above
% 13.71/8.33 # Training examples: 0 positive, 0 negative
% 13.71/8.33
% 13.71/8.33 # -------------------------------------------------
% 13.71/8.33 # User time : 0.031 s
% 13.71/8.33 # System time : 0.002 s
% 13.71/8.33 # Total time : 0.033 s
% 13.71/8.33 # Maximum resident set size: 7120 pages
% 13.71/8.33
%------------------------------------------------------------------------------