%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO147+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:27:18 PM UTC 2026
% Result : Theorem 0.02s 15.26s
% Output : CNFRefutation 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 22 ~; 16 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 4 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13,conjecture,
! [X3,X12,X13] :
( connect(X12,X13,X3)
=> ( incident_o(X3,trajectory_of(X13))
& incident_o(X3,trajectory_of(X12)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13) ).
fof(at_on_trajectory,axiom,
! [X12,X3] :
( once(at(X12,X3))
<=> incident_o(X3,trajectory_of(X12)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',at_on_trajectory) ).
fof(conjunction_at_the_same_time,axiom,
! [X14,X15] :
( once(at_the_same_time(X14,X15))
=> ( once(X15)
& once(X14) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',conjunction_at_the_same_time) ).
fof(connect_defn,axiom,
! [X12,X13,X3] :
( connect(X12,X13,X3)
<=> once(at_the_same_time(at(X12,X3),at(X13,X3))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+3.ax',connect_defn) ).
fof(c_0_4,negated_conjecture,
~ ! [X3,X12,X13] :
( connect(X12,X13,X3)
=> ( incident_o(X3,trajectory_of(X13))
& incident_o(X3,trajectory_of(X12)) ) ),
inference(assume_negation,[status(cth)],[t13]) ).
fof(c_0_5,negated_conjecture,
( ( ~ incident_o(esk1_0,trajectory_of(esk3_0))
| ~ incident_o(esk1_0,trajectory_of(esk2_0)) )
& connect(esk2_0,esk3_0,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X26,X27] :
( ( once(at(X26,X27))
| ~ incident_o(X27,trajectory_of(X26)) )
& ( incident_o(X27,trajectory_of(X26))
| ~ once(at(X26,X27)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[at_on_trajectory])])]) ).
fof(c_0_7,plain,
! [X49,X50] :
( ( ~ once(at_the_same_time(X49,X50))
| once(X50) )
& ( ~ once(at_the_same_time(X49,X50))
| once(X49) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conjunction_at_the_same_time])])])]) ).
fof(c_0_8,plain,
! [X36,X37,X38] :
( ( connect(X36,X37,X38)
| ~ once(at_the_same_time(at(X36,X38),at(X37,X38))) )
& ( once(at_the_same_time(at(X36,X38),at(X37,X38)))
| ~ connect(X36,X37,X38) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connect_defn])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ incident_o(esk1_0,trajectory_of(esk3_0))
| ~ incident_o(esk1_0,trajectory_of(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ once(at(X1,X2))
| incident_o(X2,trajectory_of(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ once(at_the_same_time(X1,X2))
| once(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ connect(X1,X2,X3)
| once(at_the_same_time(at(X1,X3),at(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( ~ incident_o(esk1_0,trajectory_of(esk2_0))
| ~ once(at(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ connect(X1,X3,X2)
| once(at(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
connect(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( ~ once(at_the_same_time(X2,X1))
| once(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( ~ once(at(esk2_0,esk1_0))
| ~ once(at(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,negated_conjecture,
once(at(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ connect(X3,X1,X2)
| once(at(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
~ once(at(esk3_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GEO147+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.02/15.23 % CPULimit : 300
% 0.02/15.23 % WCLimit : 300
% 0.02/15.23 % DateTime : Sun Sep 20 12:44:26 UTC 2026
% 0.02/15.23 % CPUTime :
% 0.02/15.23 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.02/15.25 Running first-order theorem proving
% 0.02/15.25 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.02/15.26 % Version: 3.5.1
% 0.02/15.26 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.02/15.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/15.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.02/15.26 % Starting new_bool_3 with 300s (1) cores
% 0.02/15.26 % Starting new_bool_1 with 300s (1) cores
% 0.02/15.26 % Starting sh5l with 300s (1) cores
% 0.02/15.26 % new_bool_3 with pid 230920 completed with status 0
% 0.02/15.26 % Result found by new_bool_3
% 0.02/15.26 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.02/15.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/15.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.02/15.26 % Starting new_bool_3 with 300s (1) cores
% 0.02/15.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.02/15.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.02/15.26 % Search class: FGHSF-FFMF21-MFFFFFNN
% 0.02/15.26 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.02/15.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.02/15.26 % Starting SubtermCWHack with 31s (1) cores
% 0.02/15.26 % SubtermCWHack with pid 230923 completed with status 0
% 0.02/15.26 % Result found by SubtermCWHack
% 0.02/15.26 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.02/15.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.02/15.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.02/15.26 % Starting new_bool_3 with 300s (1) cores
% 0.02/15.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.02/15.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.02/15.26 % Search class: FGHSF-FFMF21-MFFFFFNN
% 0.02/15.26 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.02/15.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.02/15.26 % Starting SubtermCWHack with 31s (1) cores
% 0.02/15.26 % Preprocessing time : 0.001 s
% 0.02/15.26
% 0.02/15.26 % Proof found!
% 0.02/15.26 % SZS status Theorem
% 0.02/15.26 % SZS output start CNFRefutation
% See solution above
% 0.02/15.26 % Parsed axioms : 37
% 0.02/15.26 % Removed by relevancy pruning/SinE : 25
% 0.02/15.26 % Initial clauses : 20
% 0.02/15.26 % Removed in clause preprocessing : 0
% 0.02/15.26 % Initial clauses in saturation : 20
% 0.02/15.26 % Processed clauses : 49
% 0.02/15.26 % ...of these trivial : 0
% 0.02/15.26 % ...subsumed : 18
% 0.02/15.26 % ...remaining for further processing : 31
% 0.02/15.26 % Other redundant clauses eliminated : 0
% 0.02/15.26 % Clauses deleted for lack of memory : 0
% 0.02/15.26 % Backward-subsumed : 1
% 0.02/15.26 % Backward-rewritten : 1
% 0.02/15.26 % Generated clauses : 57
% 0.02/15.26 % ...of the previous two non-redundant : 48
% 0.02/15.26 % ...aggressively subsumed : 0
% 0.02/15.26 % Contextual simplify-reflections : 0
% 0.02/15.26 % Paramodulations : 55
% 0.02/15.26 % Factorizations : 2
% 0.02/15.26 % NegExts : 0
% 0.02/15.26 % Equation resolutions : 0
% 0.02/15.26 % Disequality decompositions : 0
% 0.02/15.26 % Total rewrite steps : 1
% 0.02/15.26 % ...of those cached : 0
% 0.02/15.26 % Propositional unsat checks : 0
% 0.02/15.26 % Propositional check models : 0
% 0.02/15.26 % Propositional check unsatisfiable : 0
% 0.02/15.26 % Propositional clauses : 0
% 0.02/15.26 % Propositional clauses after purity: 0
% 0.02/15.26 % Propositional unsat core size : 0
% 0.02/15.26 % Propositional preprocessing time : 0.000
% 0.02/15.26 % Propositional encoding time : 0.000
% 0.02/15.26 % Propositional solver time : 0.000
% 0.02/15.26 % Success case prop preproc time : 0.000
% 0.02/15.26 % Success case prop encoding time : 0.000
% 0.02/15.26 % Success case prop solver time : 0.000
% 0.02/15.26 % Current number of processed clauses : 29
% 0.02/15.26 % Positive orientable unit clauses : 3
% 0.02/15.26 % Positive unorientable unit clauses: 0
% 0.02/15.26 % Negative unit clauses : 1
% 0.02/15.26 % Non-unit-clauses : 25
% 0.02/15.26 % Current number of unprocessed clauses: 19
% 0.02/15.26 % ...number of literals in the above : 45
% 0.02/15.26 % Current number of archived formulas : 0
% 0.02/15.26 % Current number of archived clauses : 2
% 0.02/15.26 % Clause-clause subsumption calls (NU) : 120
% 0.02/15.26 % Rec. Clause-clause subsumption calls : 120
% 0.02/15.26 % Non-unit clause-clause subsumptions : 18
% 0.02/15.26 % Unit Clause-clause subsumption calls : 7
% 0.02/15.26 % Rewrite failures with RHS unbound : 0
% 0.02/15.26 % BW rewrite match attempts : 1
% 0.02/15.26 % BW rewrite match successes : 1
% 0.02/15.26 % Condensation attempts : 0
% 0.02/15.26 % Condensation successes : 0
% 0.02/15.26 % Termbank termtop insertions : 2361
% 0.02/15.26 % Search garbage collected termcells : 543
% 0.02/15.26
% 0.02/15.26 % -------------------------------------------------
% 0.02/15.26 % User time : 0.004 s
% 0.02/15.26 % System time : 0.001 s
% 0.02/15.26 % Total time : 0.005 s
% 0.02/15.26 % Maximum resident set size: 3696 pages
% 0.02/15.26
% 0.02/15.26 % -------------------------------------------------
% 0.02/15.26 % User time : 0.007 s
% 0.02/15.26 % System time : 0.002 s
% 0.02/15.26 % Total time : 0.009 s
% 0.02/15.26 % Maximum resident set size: 4608 pages
% 0.02/15.26 % E exiting
%------------------------------------------------------------------------------