%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ012_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 02:01:32 PM UTC 2026
% Result : Theorem 0.03s 0.43s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 29 ~; 24 |; 4 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
box: $tType ).
tff(decl_sort2,type,
fruit: $tType ).
tff(decl_23,type,
boxa: box ).
tff(decl_24,type,
boxb: box ).
tff(decl_25,type,
boxc: box ).
tff(decl_26,type,
apples: fruit ).
tff(decl_27,type,
bananas: fruit ).
tff(decl_28,type,
oranges: fruit ).
tff(decl_29,type,
equal_fruits: ( fruit * fruit ) > $o ).
tff(decl_31,type,
contains: ( fruit * box ) > $o ).
tff(decl_32,type,
label: ( fruit * box ) > $o ).
tff(prove_boxa_contains_bananas_and_boxc_oranges,conjecture,
( contains(boxc,oranges)
& contains(boxa,bananas) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_boxa_contains_bananas_and_boxc_oranges) ).
tff(label_is_wrong,axiom,
! [X3: box,X4: fruit] :
~ ( contains(X3,X4)
& label(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_is_wrong) ).
tff(each_thing_is_in_a_box,axiom,
! [X1: fruit] :
( contains(boxc,X1)
| contains(boxb,X1)
| contains(boxa,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',each_thing_is_in_a_box) ).
tff(boxb_labelled_oranges,hypothesis,
label(boxb,oranges),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxb_labelled_oranges) ).
tff(each_box_contains_something,axiom,
! [X5: box] :
( contains(X5,oranges)
| contains(X5,bananas)
| contains(X5,apples) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',each_box_contains_something) ).
tff(boxa_labelled_apples,hypothesis,
label(boxa,apples),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxa_labelled_apples) ).
tff(bananas_not_oranges,axiom,
~ equal_fruits(bananas,oranges),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bananas_not_oranges) ).
tff(contains_is_well_defined1,axiom,
! [X6: box,X4: fruit,X7: fruit] :
( ( contains(X6,X7)
& contains(X6,X4) )
=> equal_fruits(X4,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',contains_is_well_defined1) ).
tff(boxc_labelled_bananas,hypothesis,
label(boxc,bananas),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxc_labelled_bananas) ).
tff(apples_not_bananas,axiom,
~ equal_fruits(apples,bananas),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apples_not_bananas) ).
tff(boxb_contains_apples,hypothesis,
contains(boxb,apples),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxb_contains_apples) ).
tff(c_0_11,negated_conjecture,
~ ( contains(boxc,oranges)
& contains(boxa,bananas) ),
inference(assume_negation,[status(cth)],[prove_boxa_contains_bananas_and_boxc_oranges]) ).
tff(c_0_12,plain,
! [X10: box,X11: fruit] :
( ~ contains(X10,X11)
| ~ label(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[label_is_wrong])])]) ).
tff(c_0_13,negated_conjecture,
( ~ contains(boxc,oranges)
| ~ contains(boxa,bananas) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
tff(c_0_14,plain,
! [X13: fruit] :
( contains(boxc,X13)
| contains(boxb,X13)
| contains(boxa,X13) ),
inference(variable_rename,[status(thm)],[each_thing_is_in_a_box]) ).
tcf(c_0_15,plain,
! [X2: box,X1: fruit] :
( ~ contains(X2,X1)
| ~ label(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_16,hypothesis,
label(boxb,oranges),
inference(split_conjunct,[status(thm)],[boxb_labelled_oranges]) ).
tcf(c_0_17,negated_conjecture,
( ~ contains(boxc,oranges)
| ~ contains(boxa,bananas) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_18,plain,
! [X1: fruit] :
( contains(boxc,X1)
| contains(boxb,X1)
| contains(boxa,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_19,hypothesis,
~ contains(boxb,oranges),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
tff(c_0_20,plain,
! [X12: box] :
( contains(X12,oranges)
| contains(X12,bananas)
| contains(X12,apples) ),
inference(variable_rename,[status(thm)],[each_box_contains_something]) ).
tcf(c_0_21,hypothesis,
label(boxa,apples),
inference(split_conjunct,[status(thm)],[boxa_labelled_apples]) ).
tff(c_0_22,plain,
~ equal_fruits(bananas,oranges),
inference(fof_simplification,[status(thm)],[bananas_not_oranges]) ).
tff(c_0_23,plain,
! [X14: box,X15: fruit,X16: fruit] :
( equal_fruits(X15,X16)
| ~ contains(X14,X16)
| ~ contains(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[contains_is_well_defined1])])]) ).
tcf(c_0_24,negated_conjecture,
( ~ contains(boxa,bananas)
| contains(boxa,oranges) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
tcf(c_0_25,plain,
! [X2: box] :
( contains(X2,oranges)
| contains(X2,bananas)
| contains(X2,apples) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_26,hypothesis,
~ contains(boxa,apples),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
tcf(c_0_27,hypothesis,
label(boxc,bananas),
inference(split_conjunct,[status(thm)],[boxc_labelled_bananas]) ).
tff(c_0_28,plain,
~ equal_fruits(bananas,oranges),
inference(fof_nnf,[status(thm)],[c_0_22]) ).
tcf(c_0_29,plain,
! [X1: fruit,X2: box,X4: fruit] :
( ~ contains(X2,X4)
| ~ contains(X2,X1)
| equal_fruits(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_30,negated_conjecture,
contains(boxa,oranges),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
tcf(c_0_31,hypothesis,
~ contains(boxc,bananas),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
tcf(c_0_32,plain,
~ equal_fruits(bananas,oranges),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
tcf(c_0_33,negated_conjecture,
! [X1: fruit] :
( ~ contains(boxa,X1)
| equal_fruits(X1,oranges) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
tff(c_0_34,plain,
~ equal_fruits(apples,bananas),
inference(fof_simplification,[status(thm)],[apples_not_bananas]) ).
tcf(c_0_35,hypothesis,
( contains(boxb,bananas)
| contains(boxa,bananas) ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
tcf(c_0_36,negated_conjecture,
~ contains(boxa,bananas),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
tff(c_0_37,plain,
~ equal_fruits(apples,bananas),
inference(fof_nnf,[status(thm)],[c_0_34]) ).
tcf(c_0_38,hypothesis,
contains(boxb,bananas),
inference(sr,[status(thm)],[c_0_35,c_0_36]) ).
tcf(c_0_39,plain,
~ equal_fruits(apples,bananas),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
tcf(c_0_40,hypothesis,
! [X1: fruit] :
( ~ contains(boxb,X1)
| equal_fruits(X1,bananas) ),
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
tcf(c_0_41,hypothesis,
contains(boxb,apples),
inference(split_conjunct,[status(thm)],[boxb_contains_apples]) ).
cnf(c_0_42,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ012_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 03:48:21 UTC 2026
% 0.03/0.37 % CPUTime :
% 0.03/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.41 Running first-order theorem proving
% 0.03/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
% 0.03/0.43 % Version: 3.5.1
% 0.03/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.43 % Starting sh5l with 300s (1) cores
% 0.03/0.43 % new_bool_3 with pid 489805 completed with status 0
% 0.03/0.43 % Result found by new_bool_3
% 0.03/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.43 % Search class: FGHNS-FFSS00-SFFFFFNN
% 0.03/0.43 % partial match(1): FGHNF-FFSS00-SFFFFFNN
% 0.03/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.43 % SubtermCWHack with pid 489812 completed with status 0
% 0.03/0.43 % Result found by SubtermCWHack
% 0.03/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.43 % Search class: FGHNS-FFSS00-SFFFFFNN
% 0.03/0.43 % partial match(1): FGHNF-FFSS00-SFFFFFNN
% 0.03/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.43 % Preprocessing time : 0.001 s
% 0.03/0.43
% 0.03/0.43 % Proof found!
% 0.03/0.43 % SZS status Theorem
% 0.03/0.43 % SZS output start CNFRefutation
% See solution above
% 0.03/0.43 % Parsed axioms : 30
% 0.03/0.43 % Removed by relevancy pruning/SinE : 12
% 0.03/0.43 % Initial clauses : 18
% 0.03/0.43 % Removed in clause preprocessing : 0
% 0.03/0.43 % Initial clauses in saturation : 18
% 0.03/0.43 % Processed clauses : 37
% 0.03/0.43 % ...of these trivial : 0
% 0.03/0.43 % ...subsumed : 2
% 0.03/0.43 % ...remaining for further processing : 35
% 0.03/0.43 % Other redundant clauses eliminated : 0
% 0.03/0.43 % Clauses deleted for lack of memory : 0
% 0.03/0.43 % Backward-subsumed : 2
% 0.03/0.43 % Backward-rewritten : 3
% 0.03/0.43 % Generated clauses : 34
% 0.03/0.43 % ...of the previous two non-redundant : 32
% 0.03/0.43 % ...aggressively subsumed : 0
% 0.03/0.43 % Contextual simplify-reflections : 0
% 0.03/0.43 % Paramodulations : 33
% 0.03/0.43 % Factorizations : 0
% 0.03/0.43 % NegExts : 0
% 0.03/0.43 % Equation resolutions : 0
% 0.03/0.43 % Disequality decompositions : 0
% 0.03/0.43 % Total rewrite steps : 6
% 0.03/0.43 % ...of those cached : 3
% 0.03/0.43 % Propositional unsat checks : 0
% 0.03/0.43 % Propositional check models : 0
% 0.03/0.43 % Propositional check unsatisfiable : 0
% 0.03/0.43 % Propositional clauses : 0
% 0.03/0.43 % Propositional clauses after purity: 0
% 0.03/0.43 % Propositional unsat core size : 0
% 0.03/0.43 % Propositional preprocessing time : 0.000
% 0.03/0.43 % Propositional encoding time : 0.000
% 0.03/0.43 % Propositional solver time : 0.000
% 0.03/0.43 % Success case prop preproc time : 0.000
% 0.03/0.43 % Success case prop encoding time : 0.000
% 0.03/0.43 % Success case prop solver time : 0.000
% 0.03/0.43 % Current number of processed clauses : 29
% 0.03/0.43 % Positive orientable unit clauses : 9
% 0.03/0.43 % Positive unorientable unit clauses: 0
% 0.03/0.43 % Negative unit clauses : 10
% 0.03/0.43 % Non-unit-clauses : 10
% 0.03/0.43 % Current number of unprocessed clauses: 12
% 0.03/0.43 % ...number of literals in the above : 37
% 0.03/0.43 % Current number of archived formulas : 0
% 0.03/0.43 % Current number of archived clauses : 6
% 0.03/0.43 % Clause-clause subsumption calls (NU) : 30
% 0.03/0.43 % Rec. Clause-clause subsumption calls : 26
% 0.03/0.43 % Non-unit clause-clause subsumptions : 0
% 0.03/0.43 % Unit Clause-clause subsumption calls : 8
% 0.03/0.43 % Rewrite failures with RHS unbound : 0
% 0.03/0.43 % BW rewrite match attempts : 2
% 0.03/0.43 % BW rewrite match successes : 2
% 0.03/0.43 % Condensation attempts : 0
% 0.03/0.43 % Condensation successes : 0
% 0.03/0.43 % Termbank termtop insertions : 1090
% 0.03/0.43 % Search garbage collected termcells : 61
% 0.03/0.43
% 0.03/0.43 % -------------------------------------------------
% 0.03/0.43 % User time : 0.004 s
% 0.03/0.43 % System time : 0.002 s
% 0.03/0.43 % Total time : 0.006 s
% 0.03/0.43 % Maximum resident set size: 3648 pages
% 0.03/0.43
% 0.03/0.43 % -------------------------------------------------
% 0.03/0.43 % User time : 0.006 s
% 0.03/0.43 % System time : 0.004 s
% 0.03/0.43 % Total time : 0.010 s
% 0.03/0.43 % Maximum resident set size: 4608 pages
% 0.03/0.43 % E exiting
%------------------------------------------------------------------------------