%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MSC004-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 : n013.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.13s 0.63s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 8 unt; 5 nHn; 26 RR)
% Number of literals : 62 ( 0 equ; 30 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-5 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(hands_have_5_fingers,hypothesis,
( ~ in(X1,hand)
| has_parts(X1,n5,fingers) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hands_have_5_fingers) ).
cnf(not_part_inheritance,axiom,
( ~ has_parts(X1,X4,X2)
| has_parts(X1,times(X4,X5),X3)
| in(object_in(X1,X2,X3,X4,X5),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_part_inheritance) ).
cnf(part_inheritance,axiom,
( ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4)
| ~ has_parts(X1,X2,X5)
| has_parts(X1,times(X2,X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',part_inheritance) ).
cnf(arms_have_one_hand,hypothesis,
( ~ in(X1,arm)
| has_parts(X1,n1,hand) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arms_have_one_hand) ).
cnf(humans_have_two_arms,hypothesis,
( ~ in(X1,human)
| has_parts(X1,n2,arm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',humans_have_two_arms) ).
cnf(in_boy_in_human,hypothesis,
( ~ in(X1,boy)
| in(X1,human) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_boy_in_human) ).
cnf(prove_john_has_10_fingers,negated_conjecture,
~ has_parts(john,times(times(n2,n1),n5),fingers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_john_has_10_fingers) ).
cnf(john_is_a_boy,hypothesis,
in(john,boy),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',john_is_a_boy) ).
cnf(c_0_8,hypothesis,
( ~ in(X1,hand)
| has_parts(X1,n5,fingers) ),
inference(fof_simplification,[status(thm)],[hands_have_5_fingers]) ).
cnf(c_0_9,plain,
( ~ has_parts(X1,X4,X2)
| has_parts(X1,times(X4,X5),X3)
| in(object_in(X1,X2,X3,X4,X5),X2) ),
inference(fof_simplification,[status(thm)],[not_part_inheritance]) ).
cnf(c_0_10,plain,
( ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4)
| ~ has_parts(X1,X2,X5)
| has_parts(X1,times(X2,X3),X4) ),
inference(fof_simplification,[status(thm)],[part_inheritance]) ).
cnf(c_0_11,hypothesis,
( ~ in(X1,hand)
| has_parts(X1,n5,fingers) ),
c_0_8 ).
cnf(c_0_12,plain,
( ~ has_parts(X1,X4,X2)
| has_parts(X1,times(X4,X5),X3)
| in(object_in(X1,X2,X3,X4,X5),X2) ),
c_0_9 ).
cnf(c_0_13,hypothesis,
( ~ in(X1,arm)
| has_parts(X1,n1,hand) ),
inference(fof_simplification,[status(thm)],[arms_have_one_hand]) ).
cnf(c_0_14,hypothesis,
( ~ in(X1,human)
| has_parts(X1,n2,arm) ),
inference(fof_simplification,[status(thm)],[humans_have_two_arms]) ).
cnf(c_0_15,hypothesis,
( ~ in(X1,boy)
| in(X1,human) ),
inference(fof_simplification,[status(thm)],[in_boy_in_human]) ).
cnf(c_0_16,negated_conjecture,
~ has_parts(john,times(times(n2,n1),n5),fingers),
inference(fof_simplification,[status(thm)],[prove_john_has_10_fingers]) ).
cnf(c_0_17,plain,
( ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4)
| ~ has_parts(X1,X2,X5)
| has_parts(X1,times(X2,X3),X4) ),
c_0_10 ).
cnf(c_0_18,hypothesis,
( ~ has_parts(X1,X3,hand)
| has_parts(X1,times(X3,X4),X2)
| has_parts(object_in(X1,hand,X2,X3,X4),n5,fingers) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,hypothesis,
( ~ in(X1,arm)
| has_parts(X1,n1,hand) ),
c_0_13 ).
cnf(c_0_20,hypothesis,
( ~ in(X1,human)
| has_parts(X1,n2,arm) ),
c_0_14 ).
cnf(c_0_21,hypothesis,
( ~ in(X1,boy)
| in(X1,human) ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
~ has_parts(john,times(times(n2,n1),n5),fingers),
c_0_16 ).
cnf(c_0_23,hypothesis,
( ~ has_parts(X1,X2,hand)
| has_parts(X1,times(X2,n5),fingers) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,hypothesis,
( ~ has_parts(X1,X3,arm)
| has_parts(X1,times(X3,X4),X2)
| has_parts(object_in(X1,arm,X2,X3,X4),n1,hand) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_25,hypothesis,
( ~ in(X1,boy)
| has_parts(X1,n2,arm) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
in(john,boy),
john_is_a_boy ).
cnf(c_0_27,negated_conjecture,
~ has_parts(john,times(n2,n1),hand),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,hypothesis,
( ~ has_parts(X1,X2,arm)
| has_parts(X1,times(X2,n1),hand) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_29,hypothesis,
has_parts(john,n2,arm),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC004-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.11/0.57 % Computer : n013.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.57 % DateTime : Mon Sep 21 01:26:36 UTC 2026
% 0.11/0.57 % CPUTime :
% 0.11/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.61 Running first-order theorem proving
% 0.11/0.61 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.13/0.63 % Version: 3.5.1
% 0.13/0.63 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.13/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.63 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.13/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.63 % Starting sh5l with 300s (1) cores
% 0.13/0.63 % new_bool_1 with pid 3863863 completed with status 0
% 0.13/0.63 % Result found by new_bool_1
% 0.13/0.63 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.13/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.63 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.13/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.63 % Search class: FGUNF-FFSF33-SFFFFFNN
% 0.13/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.63 % SubtermCWHack with pid 3863869 completed with status 0
% 0.13/0.63 % Result found by SubtermCWHack
% 0.13/0.63 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.13/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.63 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.13/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.63 % Search class: FGUNF-FFSF33-SFFFFFNN
% 0.13/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.63 % Preprocessing time : 0.001 s
% 0.13/0.63
% 0.13/0.63 % Proof found!
% 0.13/0.63 % SZS status Unsatisfiable
% 0.13/0.63 % SZS output start CNFRefutation
% See solution above
% 0.13/0.63 % Parsed axioms : 8
% 0.13/0.63 % Removed by relevancy pruning/SinE : 0
% 0.13/0.63 % Initial clauses : 8
% 0.13/0.63 % Removed in clause preprocessing : 0
% 0.13/0.63 % Initial clauses in saturation : 8
% 0.13/0.63 % Processed clauses : 15
% 0.13/0.63 % ...of these trivial : 0
% 0.13/0.63 % ...subsumed : 0
% 0.13/0.63 % ...remaining for further processing : 15
% 0.13/0.63 % Other redundant clauses eliminated : 0
% 0.13/0.63 % Clauses deleted for lack of memory : 0
% 0.13/0.63 % Backward-subsumed : 0
% 0.13/0.63 % Backward-rewritten : 0
% 0.13/0.63 % Generated clauses : 12
% 0.13/0.63 % ...of the previous two non-redundant : 11
% 0.13/0.63 % ...aggressively subsumed : 0
% 0.13/0.63 % Contextual simplify-reflections : 0
% 0.13/0.63 % Paramodulations : 12
% 0.13/0.63 % Factorizations : 0
% 0.13/0.63 % NegExts : 0
% 0.13/0.63 % Equation resolutions : 0
% 0.13/0.63 % Disequality decompositions : 0
% 0.13/0.63 % Total rewrite steps : 1
% 0.13/0.63 % ...of those cached : 0
% 0.13/0.63 % Propositional unsat checks : 0
% 0.13/0.63 % Propositional check models : 0
% 0.13/0.63 % Propositional check unsatisfiable : 0
% 0.13/0.63 % Propositional clauses : 0
% 0.13/0.63 % Propositional clauses after purity: 0
% 0.13/0.63 % Propositional unsat core size : 0
% 0.13/0.63 % Propositional preprocessing time : 0.000
% 0.13/0.63 % Propositional encoding time : 0.000
% 0.13/0.63 % Propositional solver time : 0.000
% 0.13/0.63 % Success case prop preproc time : 0.000
% 0.13/0.63 % Success case prop encoding time : 0.000
% 0.13/0.63 % Success case prop solver time : 0.000
% 0.13/0.63 % Current number of processed clauses : 15
% 0.13/0.63 % Positive orientable unit clauses : 2
% 0.13/0.63 % Positive unorientable unit clauses: 0
% 0.13/0.63 % Negative unit clauses : 2
% 0.13/0.63 % Non-unit-clauses : 11
% 0.13/0.63 % Current number of unprocessed clauses: 4
% 0.13/0.63 % ...number of literals in the above : 12
% 0.13/0.63 % Current number of archived formulas : 0
% 0.13/0.63 % Current number of archived clauses : 0
% 0.13/0.63 % Clause-clause subsumption calls (NU) : 8
% 0.13/0.63 % Rec. Clause-clause subsumption calls : 8
% 0.13/0.63 % Non-unit clause-clause subsumptions : 0
% 0.13/0.63 % Unit Clause-clause subsumption calls : 1
% 0.13/0.63 % Rewrite failures with RHS unbound : 0
% 0.13/0.63 % BW rewrite match attempts : 0
% 0.13/0.63 % BW rewrite match successes : 0
% 0.13/0.63 % Condensation attempts : 0
% 0.13/0.63 % Condensation successes : 0
% 0.13/0.63 % Termbank termtop insertions : 434
% 0.13/0.63 % Search garbage collected termcells : 22
% 0.13/0.63
% 0.13/0.63 % -------------------------------------------------
% 0.13/0.63 % User time : 0.004 s
% 0.13/0.63 % System time : 0.001 s
% 0.13/0.63 % Total time : 0.005 s
% 0.13/0.63 % Maximum resident set size: 3636 pages
% 0.13/0.63
% 0.13/0.63 % -------------------------------------------------
% 0.13/0.63 % User time : 0.004 s
% 0.13/0.63 % System time : 0.005 s
% 0.13/0.63 % Total time : 0.009 s
% 0.13/0.63 % Maximum resident set size: 4864 pages
% 0.13/0.63 % E exiting
%------------------------------------------------------------------------------