%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MSC001-1 : 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 : n016.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:25 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 43 ( 13 unt; 4 nHn; 35 RR)
% Number of literals : 87 ( 0 equ; 51 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 96 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_11,axiom,
( ~ at(X1,there,X2)
| ~ red(X1)
| answer(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(prove_there_is_a_red_thing,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_red_thing) ).
cnf(clause_9,axiom,
( ~ at(hand,X3,X2)
| ~ hold(thing(X1),X2)
| at(thing(X1),X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_13,axiom,
( ~ hold(thing(X1),X2)
| hold(thing(X1),do(go(X3),X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_13) ).
cnf(clause_8,axiom,
( ~ at(thing(X3),X1,X2)
| ~ at(hand,X1,X2)
| hold(thing(taken(X2)),do(pick_up,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_14,axiom,
( ~ at(hand,X1,X2)
| at(thing(taken(X2)),X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_5,axiom,
at(hand,X1,do(go(X1),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_7,axiom,
( ~ at(thing(X1),X2,do(go(X2),X3))
| hold(thing(X1),X3)
| at(thing(X1),X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(things_here_now_are_red,hypothesis,
( ~ at(X1,here,now)
| red(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',things_here_now_are_red) ).
cnf(clause_17,axiom,
( ~ at(X1,X2,do(let_go,X3))
| at(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).
cnf(clause_2,axiom,
~ hold(thing(X1),do(let_go,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(c_0_11,plain,
( ~ at(X1,there,X2)
| ~ red(X1)
| answer(X2) ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_12,negated_conjecture,
~ answer(X1),
inference(fof_simplification,[status(thm)],[prove_there_is_a_red_thing]) ).
cnf(c_0_13,plain,
( ~ at(hand,X3,X2)
| ~ hold(thing(X1),X2)
| at(thing(X1),X3,X2) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_14,plain,
( ~ hold(thing(X1),X2)
| hold(thing(X1),do(go(X3),X2)) ),
inference(fof_simplification,[status(thm)],[clause_13]) ).
cnf(c_0_15,plain,
( ~ at(X1,there,X2)
| ~ red(X1)
| answer(X2) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
~ answer(X1),
c_0_12 ).
cnf(c_0_17,plain,
( ~ at(hand,X3,X2)
| ~ hold(thing(X1),X2)
| at(thing(X1),X3,X2) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ hold(thing(X1),X2)
| hold(thing(X1),do(go(X3),X2)) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ at(thing(X3),X1,X2)
| ~ at(hand,X1,X2)
| hold(thing(taken(X2)),do(pick_up,X2)) ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_20,plain,
( ~ at(hand,X1,X2)
| at(thing(taken(X2)),X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_14]) ).
cnf(c_0_21,plain,
( ~ at(X1,there,X2)
| ~ red(X1) ),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ at(hand,X2,do(go(X3),X4))
| ~ hold(thing(X1),X4)
| at(thing(X1),X2,do(go(X3),X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ at(thing(X3),X1,X2)
| ~ at(hand,X1,X2)
| hold(thing(taken(X2)),do(pick_up,X2)) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ at(hand,X1,X2)
| at(thing(taken(X2)),X1,X2) ),
c_0_20 ).
cnf(c_0_25,plain,
( ~ at(hand,there,do(go(X3),X2))
| ~ hold(thing(X1),X2)
| ~ red(thing(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
at(hand,X1,do(go(X1),X2)),
clause_5 ).
cnf(c_0_27,plain,
( ~ at(hand,X2,X1)
| hold(thing(taken(X1)),do(pick_up,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ at(thing(X1),X2,do(go(X2),X3))
| hold(thing(X1),X3)
| at(thing(X1),X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_29,plain,
( ~ hold(thing(X1),X2)
| ~ red(thing(X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
hold(thing(taken(do(go(X1),X2))),do(pick_up,do(go(X1),X2))),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_31,hypothesis,
( ~ at(X1,here,now)
| red(X1) ),
inference(fof_simplification,[status(thm)],[things_here_now_are_red]) ).
cnf(c_0_32,plain,
( ~ at(X1,X2,do(let_go,X3))
| at(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_17]) ).
cnf(c_0_33,plain,
( ~ at(thing(X1),X2,do(go(X2),X3))
| hold(thing(X1),X3)
| at(thing(X1),X2,X3) ),
c_0_28 ).
cnf(c_0_34,plain,
~ hold(thing(X1),do(let_go,X2)),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_35,plain,
~ red(thing(taken(do(go(X1),X2)))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,hypothesis,
( ~ at(X1,here,now)
| red(X1) ),
c_0_31 ).
cnf(c_0_37,plain,
( ~ at(X1,X2,do(let_go,X3))
| at(X1,X2,X3) ),
c_0_32 ).
cnf(c_0_38,plain,
( at(thing(taken(do(go(X1),X2))),X1,X2)
| hold(thing(taken(do(go(X1),X2))),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_26])]) ).
cnf(c_0_39,plain,
~ hold(thing(X1),do(let_go,X2)),
c_0_34 ).
cnf(c_0_40,hypothesis,
~ at(thing(taken(do(go(X1),X2))),here,now),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
at(thing(taken(do(go(X1),do(let_go,X2)))),X1,X2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_40,c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n016.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:31:37 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % sh5l with pid 1284112 completed with status 0
% 0.14/0.43 % Result found by sh5l
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 1284119 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 18
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 18
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 18
% 0.14/0.43 % Processed clauses : 64
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 19
% 0.14/0.43 % ...remaining for further processing : 45
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 2
% 0.14/0.43 % Backward-rewritten : 0
% 0.14/0.43 % Generated clauses : 106
% 0.14/0.43 % ...of the previous two non-redundant : 96
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 106
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 4
% 0.14/0.43 % ...of those cached : 2
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 43
% 0.14/0.43 % Positive orientable unit clauses : 4
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 8
% 0.14/0.43 % Non-unit-clauses : 31
% 0.14/0.43 % Current number of unprocessed clauses: 43
% 0.14/0.43 % ...number of literals in the above : 96
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 2
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 236
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 229
% 0.14/0.43 % Non-unit clause-clause subsumptions : 15
% 0.14/0.43 % Unit Clause-clause subsumption calls : 22
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 12
% 0.14/0.43 % BW rewrite match successes : 0
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 2406
% 0.14/0.43 % Search garbage collected termcells : 42
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.006 s
% 0.14/0.43 % System time : 0.003 s
% 0.14/0.43 % Total time : 0.009 s
% 0.14/0.43 % Maximum resident set size: 3644 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.010 s
% 0.14/0.43 % System time : 0.005 s
% 0.14/0.43 % Total time : 0.015 s
% 0.14/0.43 % Maximum resident set size: 4608 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------