%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MSC002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 01:28:26 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 11 unt; 3 nHn; 26 RR)
% Number of literals : 77 ( 0 equ; 43 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 95 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(can_put_somewhere_if_grab_and_go_there,axiom,
( ~ grabbed(X1,X3)
| ~ at(X1,X2,X3)
| put(X1,X4,go(X4,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',can_put_somewhere_if_grab_and_go_there) ).
cnf(situation_pick_up,axiom,
( ~ at(X1,X2,X3)
| at(X1,X2,pick_up(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',situation_pick_up) ).
cnf(can_grab_if_previously_let_go,axiom,
( ~ at(X1,X2,X3)
| grabbed(X1,pick_up(go(X2,let_go(X3)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',can_grab_if_previously_let_go) ).
cnf(thing_either_held_or_went_there,axiom,
( ~ at(X1,X3,X2)
| at(X1,X3,go(X4,X2))
| held(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thing_either_held_or_went_there) ).
cnf(situation_let_go,axiom,
( ~ at(X1,X2,X3)
| at(X1,X2,let_go(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',situation_let_go) ).
cnf(cant_hold_and_let_go,axiom,
~ held(X1,let_go(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cant_hold_and_let_go) ).
cnf(answer_if_red_and_put_there,axiom,
( ~ put(X1,there,X2)
| ~ red(X1)
| answer(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',answer_if_red_and_put_there) ).
cnf(prove_there_is_an_answer_situation,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_an_answer_situation) ).
cnf(something_is_here_now,axiom,
at(something,here,now),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',something_is_here_now) ).
cnf(everything_is_red,axiom,
( ~ at(X1,here,X2)
| red(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',everything_is_red) ).
cnf(c_0_10,plain,
( ~ grabbed(X1,X3)
| ~ at(X1,X2,X3)
| put(X1,X4,go(X4,X3)) ),
inference(fof_simplification,[status(thm)],[can_put_somewhere_if_grab_and_go_there]) ).
cnf(c_0_11,plain,
( ~ at(X1,X2,X3)
| at(X1,X2,pick_up(X3)) ),
inference(fof_simplification,[status(thm)],[situation_pick_up]) ).
cnf(c_0_12,plain,
( ~ grabbed(X1,X3)
| ~ at(X1,X2,X3)
| put(X1,X4,go(X4,X3)) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ at(X1,X2,X3)
| at(X1,X2,pick_up(X3)) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ at(X1,X2,X3)
| grabbed(X1,pick_up(go(X2,let_go(X3)))) ),
inference(fof_simplification,[status(thm)],[can_grab_if_previously_let_go]) ).
cnf(c_0_15,plain,
( ~ at(X1,X3,X2)
| at(X1,X3,go(X4,X2))
| held(X1,X2) ),
inference(fof_simplification,[status(thm)],[thing_either_held_or_went_there]) ).
cnf(c_0_16,plain,
( ~ at(X1,X2,X3)
| at(X1,X2,let_go(X3)) ),
inference(fof_simplification,[status(thm)],[situation_let_go]) ).
cnf(c_0_17,plain,
~ held(X1,let_go(X2)),
inference(fof_simplification,[status(thm)],[cant_hold_and_let_go]) ).
cnf(c_0_18,plain,
( ~ at(X1,X4,X3)
| ~ grabbed(X1,pick_up(X3))
| put(X1,X2,go(X2,pick_up(X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ at(X1,X2,X3)
| grabbed(X1,pick_up(go(X2,let_go(X3)))) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ at(X1,X3,X2)
| at(X1,X3,go(X4,X2))
| held(X1,X2) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ at(X1,X2,X3)
| at(X1,X2,let_go(X3)) ),
c_0_16 ).
cnf(c_0_22,plain,
~ held(X1,let_go(X2)),
c_0_17 ).
cnf(c_0_23,plain,
( ~ at(X1,X3,X4)
| ~ at(X1,X5,go(X3,let_go(X4)))
| put(X1,X2,go(X2,pick_up(go(X3,let_go(X4))))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ at(X1,X2,X4)
| at(X1,X2,go(X3,let_go(X4))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
( ~ put(X1,there,X2)
| ~ red(X1)
| answer(X2) ),
inference(fof_simplification,[status(thm)],[answer_if_red_and_put_there]) ).
cnf(c_0_26,negated_conjecture,
~ answer(X1),
inference(fof_simplification,[status(thm)],[prove_there_is_an_answer_situation]) ).
cnf(c_0_27,plain,
( ~ at(X1,X5,X4)
| ~ at(X1,X3,X4)
| put(X1,X2,go(X2,pick_up(go(X3,let_go(X4))))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,axiom,
at(something,here,now),
something_is_here_now ).
cnf(c_0_29,plain,
( ~ at(X1,here,X2)
| red(X1) ),
inference(fof_simplification,[status(thm)],[everything_is_red]) ).
cnf(c_0_30,plain,
( ~ put(X1,there,X2)
| ~ red(X1)
| answer(X2) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
~ answer(X1),
c_0_26 ).
cnf(c_0_32,plain,
( ~ at(something,X2,now)
| put(something,X1,go(X1,pick_up(go(here,let_go(now))))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ at(X1,here,X2)
| red(X1) ),
c_0_29 ).
cnf(c_0_34,plain,
( ~ red(X1)
| ~ put(X1,there,X2) ),
inference(sr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
put(something,X1,go(X1,pick_up(go(here,let_go(now))))),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_36,plain,
red(something),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_37,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 01:27:21 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 0.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1401972 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGUNF-FFSF21-MFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1401977 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGUNF-FFSF21-MFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45 % Presaturation interreduction done
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Unsatisfiable
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 10
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 10
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 10
% 0.11/0.45 % Processed clauses : 45
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 3
% 0.11/0.45 % ...remaining for further processing : 42
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 1
% 0.11/0.45 % Backward-rewritten : 1
% 0.11/0.45 % Generated clauses : 78
% 0.11/0.45 % ...of the previous two non-redundant : 72
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 78
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 8
% 0.11/0.45 % ...of those cached : 6
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 30
% 0.11/0.45 % Positive orientable unit clauses : 3
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 3
% 0.11/0.45 % Non-unit-clauses : 24
% 0.11/0.45 % Current number of unprocessed clauses: 47
% 0.11/0.45 % ...number of literals in the above : 147
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 12
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 81
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 69
% 0.11/0.45 % Non-unit clause-clause subsumptions : 3
% 0.11/0.45 % Unit Clause-clause subsumption calls : 12
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 2
% 0.11/0.45 % BW rewrite match successes : 1
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 1827
% 0.11/0.45 % Search garbage collected termcells : 24
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.005 s
% 0.11/0.45 % System time : 0.002 s
% 0.11/0.45 % Total time : 0.008 s
% 0.11/0.45 % Maximum resident set size: 3588 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.023 s
% 0.11/0.45 % System time : 0.012 s
% 0.11/0.45 % Total time : 0.035 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------