%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO454+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:28:18 PM UTC 2026
% Result : Theorem 7.02s 2.13s
% Output : CNFRefutation 7.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(adrop,axiom,
! [X1] : s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X1))) = s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X1))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',adrop) ).
fof(aNUMERAL,axiom,
! [X84] : s(num,i(s(fun(num,num),numeral),s(num,X84))) = s(num,X84),
file('/export/starexec/sandbox/benchmark/Axioms/GEO010+0.ax',aNUMERAL) ).
fof(aLIFTu_DROPu_conjunct1,conjecture,
! [X1] : s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))) = s(real,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aLIFTu_DROPu_conjunct1) ).
fof(aLIFTu_COMPONENT,axiom,
! [X1] : s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))),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/sandbox/benchmark/theBenchmark.p',aLIFTu_COMPONENT) ).
fof(c_0_4,plain,
! [X1438] : s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X1438))) = s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X1438))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
inference(variable_rename,[status(thm)],[adrop]) ).
fof(c_0_5,plain,
! [X1540] : s(num,i(s(fun(num,num),numeral),s(num,X1540))) = s(num,X1540),
inference(variable_rename,[status(thm)],[aNUMERAL]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] : s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))) = s(real,X1),
inference(assume_negation,[status(cth)],[aLIFTu_DROPu_conjunct1]) ).
fof(c_0_7,plain,
! [X1411] : s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1411))))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,X1411),
inference(variable_rename,[status(thm)],[aLIFTu_COMPONENT]) ).
cnf(c_0_8,plain,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X1))) = s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X1))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk1_0))))) != s(real,esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,plain,
s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X1))),s(num,i(s(fun(num,num),bit1),s(num,u_0))))) = s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X1))),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk1_0))))) != s(real,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))) = s(real,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO454+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 16:24:57 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.02/2.13 % Version: 3.5.1
% 7.02/2.13 % Preprocessing class: FMLMSMSLSSSNFFN.
% 7.02/2.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.02/2.13 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 7.02/2.13 % Starting new_bool_3 with 600s (2) cores
% 7.02/2.13 % Starting new_bool_1 with 600s (2) cores
% 7.02/2.13 % Starting sh5l with 300s (1) cores
% 7.02/2.13 % new_bool_1 with pid 888441 completed with status 0
% 7.02/2.13 % Result found by new_bool_1
% 7.02/2.13 % Preprocessing class: FMLMSMSLSSSNFFN.
% 7.02/2.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.02/2.13 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 7.02/2.13 % Starting new_bool_3 with 600s (2) cores
% 7.02/2.13 % Starting new_bool_1 with 600s (2) cores
% 7.02/2.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 7.02/2.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 7.02/2.13 % Search class: FGHSM-SMLM33-DFFFFFNN
% 7.02/2.13 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 7.02/2.13 % Starting SubtermCWHack with 55s (1) cores
% 7.02/2.13 % Starting new_bool_1 with 61s (1) cores
% 7.02/2.13 % new_bool_1 with pid 888445 completed with status 0
% 7.02/2.13 % Result found by new_bool_1
% 7.02/2.13 % Preprocessing class: FMLMSMSLSSSNFFN.
% 7.02/2.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.02/2.13 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 7.02/2.13 % Starting new_bool_3 with 600s (2) cores
% 7.02/2.13 % Starting new_bool_1 with 600s (2) cores
% 7.02/2.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 7.02/2.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 7.02/2.13 % Search class: FGHSM-SMLM33-DFFFFFNN
% 7.02/2.13 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 7.02/2.13 % Starting SubtermCWHack with 55s (1) cores
% 7.02/2.13 % Starting new_bool_1 with 61s (1) cores
% 7.02/2.13 % Preprocessing time : 0.489 s
% 7.02/2.13 % Presaturation interreduction done
% 7.02/2.13
% 7.02/2.13 % Proof found!
% 7.02/2.13 % SZS status Theorem
% 7.02/2.13 % SZS output start CNFRefutation
% See solution above
% 7.02/2.13 % Parsed axioms : 3209
% 7.02/2.13 % Removed by relevancy pruning/SinE : 1718
% 7.02/2.13 % Initial clauses : 4491
% 7.02/2.13 % Removed in clause preprocessing : 214
% 7.02/2.13 % Initial clauses in saturation : 4277
% 7.02/2.13 % Processed clauses : 554
% 7.02/2.13 % ...of these trivial : 33
% 7.02/2.13 % ...subsumed : 82
% 7.02/2.13 % ...remaining for further processing : 439
% 7.02/2.13 % Other redundant clauses eliminated : 0
% 7.02/2.13 % Clauses deleted for lack of memory : 0
% 7.02/2.13 % Backward-subsumed : 2
% 7.02/2.13 % Backward-rewritten : 15
% 7.02/2.13 % Generated clauses : 0
% 7.02/2.13 % ...of the previous two non-redundant : 7
% 7.02/2.13 % ...aggressively subsumed : 0
% 7.02/2.13 % Contextual simplify-reflections : 1
% 7.02/2.13 % Paramodulations : 0
% 7.02/2.13 % Factorizations : 0
% 7.02/2.13 % NegExts : 0
% 7.02/2.13 % Equation resolutions : 0
% 7.02/2.13 % Disequality decompositions : 0
% 7.02/2.13 % Total rewrite steps : 221
% 7.02/2.13 % ...of those cached : 165
% 7.02/2.13 % Propositional unsat checks : 0
% 7.02/2.13 % Propositional check models : 0
% 7.02/2.13 % Propositional check unsatisfiable : 0
% 7.02/2.13 % Propositional clauses : 0
% 7.02/2.13 % Propositional clauses after purity: 0
% 7.02/2.13 % Propositional unsat core size : 0
% 7.02/2.13 % Propositional preprocessing time : 0.000
% 7.02/2.13 % Propositional encoding time : 0.000
% 7.02/2.13 % Propositional solver time : 0.000
% 7.02/2.13 % Success case prop preproc time : 0.000
% 7.02/2.13 % Success case prop encoding time : 0.000
% 7.02/2.13 % Success case prop solver time : 0.000
% 7.02/2.13 % Current number of processed clauses : 422
% 7.02/2.13 % Positive orientable unit clauses : 120
% 7.02/2.13 % Positive unorientable unit clauses: 5
% 7.02/2.13 % Negative unit clauses : 12
% 7.02/2.13 % Non-unit-clauses : 285
% 7.02/2.13 % Current number of unprocessed clauses: 3730
% 7.02/2.13 % ...number of literals in the above : 20335
% 7.02/2.13 % Current number of archived formulas : 0
% 7.02/2.13 % Current number of archived clauses : 17
% 7.02/2.13 % Clause-clause subsumption calls (NU) : 10679
% 7.02/2.13 % Rec. Clause-clause subsumption calls : 7679
% 7.02/2.13 % Non-unit clause-clause subsumptions : 63
% 7.02/2.13 % Unit Clause-clause subsumption calls : 38
% 7.02/2.13 % Rewrite failures with RHS unbound : 4
% 7.02/2.13 % BW rewrite match attempts : 7936
% 7.02/2.13 % BW rewrite match successes : 34
% 7.02/2.13 % Condensation attempts : 0
% 7.02/2.13 % Condensation successes : 0
% 7.02/2.13 % Termbank termtop insertions : 2355833
% 7.02/2.13 % Search garbage collected termcells : 120981
% 7.02/2.13
% 7.02/2.13 % -------------------------------------------------
% 7.02/2.13 % User time : 1.370 s
% 7.02/2.13 % System time : 0.089 s
% 7.02/2.13 % Total time : 1.459 s
% 7.02/2.13 % Maximum resident set size: 33416 pages
% 7.02/2.13
% 7.02/2.13 % -------------------------------------------------
% 7.02/2.13 % User time : 2.107 s
% 7.02/2.13 % System time : 0.143 s
% 7.02/2.13 % Total time : 2.250 s
% 7.02/2.13 % Maximum resident set size: 14336 pages
% 7.02/2.13 % E exiting
%------------------------------------------------------------------------------