%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ130+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:57 PM UTC 2026
% Result : Theorem 0.07s 0.34s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 35 ( 22 unt; 0 def)
% Number of atoms : 65 ( 6 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 55 ( 25 ~; 21 |; 3 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 19 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dog_pet_type,axiom,
! [X1] :
( dog(X1)
=> pet(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dog_pet_type) ).
fof(owner_def,axiom,
! [X2,X3] :
( ( pet(X3)
& human(X2) )
=> ( owner(X2,X3)
<=> X2 = owner_of(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owner_def) ).
fof(odie_type,axiom,
dog(odie),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odie_type) ).
fof(cat_pet_type,axiom,
! [X1] :
( cat(X1)
=> pet(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cat_pet_type) ).
fof(jon_conjecture,conjecture,
hates(jon,jon),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_conjecture) ).
fof(cat_chase_axiom,axiom,
! [X2,X3] :
( ( dog(X3)
& cat(X2) )
=> ( chased(X3,X2)
=> hates(owner_of(X2),owner_of(X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cat_chase_axiom) ).
fof(jon_o_owner_axiom,axiom,
owner(jon,odie),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_o_owner_axiom) ).
fof(jon_type,axiom,
human(jon),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_type) ).
fof(garfield_type,axiom,
cat(garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',garfield_type) ).
fof(jon_g_owner_axiom,axiom,
owner(jon,garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_g_owner_axiom) ).
fof(odie_chase_axiom,axiom,
chased(odie,garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odie_chase_axiom) ).
fof(c_0_11,plain,
! [X14] :
( pet(X14)
| ~ dog(X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dog_pet_type])])]) ).
fof(c_0_12,plain,
! [X11,X12] :
( ( ~ pet(X12)
| ~ human(X11)
| owner(X11,X12)
| X11 != owner_of(X12) )
& ( ~ pet(X12)
| ~ human(X11)
| X11 = owner_of(X12)
| ~ owner(X11,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owner_def])])])]) ).
cnf(c_0_13,plain,
( ~ dog(X1)
| pet(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
dog(odie),
inference(split_conjunct,[status(thm)],[odie_type]) ).
fof(c_0_15,plain,
! [X16] :
( pet(X16)
| ~ cat(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cat_pet_type])])]) ).
fof(c_0_16,negated_conjecture,
~ hates(jon,jon),
inference(assume_negation,[status(cth)],[jon_conjecture]) ).
fof(c_0_17,plain,
! [X4,X5] :
( hates(owner_of(X4),owner_of(X5))
| ~ chased(X5,X4)
| ~ dog(X5)
| ~ cat(X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cat_chase_axiom])])]) ).
cnf(c_0_18,plain,
( ~ pet(X2)
| ~ human(X1)
| ~ owner(X1,X2)
| X1 = owner_of(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
owner(jon,odie),
inference(split_conjunct,[status(thm)],[jon_o_owner_axiom]) ).
cnf(c_0_20,plain,
human(jon),
inference(split_conjunct,[status(thm)],[jon_type]) ).
cnf(c_0_21,plain,
pet(odie),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
( ~ cat(X1)
| pet(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
cat(garfield),
inference(split_conjunct,[status(thm)],[garfield_type]) ).
fof(c_0_24,negated_conjecture,
~ hates(jon,jon),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( ~ chased(X2,X1)
| ~ dog(X2)
| ~ cat(X1)
| hates(owner_of(X1),owner_of(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
owner_of(odie) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_27,plain,
owner(jon,garfield),
inference(split_conjunct,[status(thm)],[jon_g_owner_axiom]) ).
cnf(c_0_28,plain,
pet(garfield),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,negated_conjecture,
~ hates(jon,jon),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ cat(X1)
| ~ chased(odie,X1)
| hates(owner_of(X1),jon) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_14])]) ).
cnf(c_0_31,plain,
owner_of(garfield) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_20]),c_0_28])]) ).
cnf(c_0_32,plain,
chased(odie,garfield),
inference(split_conjunct,[status(thm)],[odie_chase_axiom]) ).
cnf(c_0_33,negated_conjecture,
~ hates(jon,jon),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_23])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PUZ130+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.30 % Computer : n012.cluster.edu
% 0.02/0.30 % Model : x86_64 x86_64
% 0.02/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30 % Memory : 8046.5625MB
% 0.02/0.30 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Mon Sep 21 03:52:23 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.34 % Version: 3.5.1
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % new_bool_3 with pid 1504096 completed with status 0
% 0.07/0.34 % Result found by new_bool_3
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGUSF-FFSM11-SFFFFFNN
% 0.07/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.34 % SubtermCWHack with pid 1504101 completed with status 0
% 0.07/0.34 % Result found by SubtermCWHack
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGUSF-FFSM11-SFFFFFNN
% 0.07/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.34 % Preprocessing time : 0.001 s
% 0.07/0.34
% 0.07/0.34 % Proof found!
% 0.07/0.34 % SZS status Theorem
% 0.07/0.34 % SZS output start CNFRefutation
% See solution above
% 0.07/0.34 % Parsed axioms : 19
% 0.07/0.34 % Removed by relevancy pruning/SinE : 0
% 0.07/0.34 % Initial clauses : 23
% 0.07/0.34 % Removed in clause preprocessing : 0
% 0.07/0.34 % Initial clauses in saturation : 23
% 0.07/0.34 % Processed clauses : 37
% 0.07/0.34 % ...of these trivial : 0
% 0.07/0.34 % ...subsumed : 0
% 0.07/0.34 % ...remaining for further processing : 37
% 0.07/0.34 % Other redundant clauses eliminated : 1
% 0.07/0.34 % Clauses deleted for lack of memory : 0
% 0.07/0.34 % Backward-subsumed : 4
% 0.07/0.34 % Backward-rewritten : 0
% 0.07/0.34 % Generated clauses : 40
% 0.07/0.34 % ...of the previous two non-redundant : 35
% 0.07/0.34 % ...aggressively subsumed : 0
% 0.07/0.34 % Contextual simplify-reflections : 1
% 0.07/0.34 % Paramodulations : 35
% 0.07/0.34 % Factorizations : 4
% 0.07/0.34 % NegExts : 0
% 0.07/0.34 % Equation resolutions : 1
% 0.07/0.34 % Disequality decompositions : 0
% 0.07/0.34 % Total rewrite steps : 16
% 0.07/0.34 % ...of those cached : 6
% 0.07/0.34 % Propositional unsat checks : 0
% 0.07/0.34 % Propositional check models : 0
% 0.07/0.34 % Propositional check unsatisfiable : 0
% 0.07/0.34 % Propositional clauses : 0
% 0.07/0.34 % Propositional clauses after purity: 0
% 0.07/0.34 % Propositional unsat core size : 0
% 0.07/0.34 % Propositional preprocessing time : 0.000
% 0.07/0.34 % Propositional encoding time : 0.000
% 0.07/0.34 % Propositional solver time : 0.000
% 0.07/0.34 % Success case prop preproc time : 0.000
% 0.07/0.34 % Success case prop encoding time : 0.000
% 0.07/0.34 % Success case prop solver time : 0.000
% 0.07/0.34 % Current number of processed clauses : 32
% 0.07/0.34 % Positive orientable unit clauses : 20
% 0.07/0.34 % Positive unorientable unit clauses: 0
% 0.07/0.34 % Negative unit clauses : 1
% 0.07/0.34 % Non-unit-clauses : 11
% 0.07/0.34 % Current number of unprocessed clauses: 4
% 0.07/0.34 % ...number of literals in the above : 15
% 0.07/0.34 % Current number of archived formulas : 0
% 0.07/0.34 % Current number of archived clauses : 4
% 0.07/0.34 % Clause-clause subsumption calls (NU) : 11
% 0.07/0.34 % Rec. Clause-clause subsumption calls : 11
% 0.07/0.34 % Non-unit clause-clause subsumptions : 1
% 0.07/0.34 % Unit Clause-clause subsumption calls : 9
% 0.07/0.34 % Rewrite failures with RHS unbound : 0
% 0.07/0.34 % BW rewrite match attempts : 2
% 0.07/0.34 % BW rewrite match successes : 2
% 0.07/0.34 % Condensation attempts : 0
% 0.07/0.34 % Condensation successes : 0
% 0.07/0.34 % Termbank termtop insertions : 1275
% 0.07/0.34 % Search garbage collected termcells : 195
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.003 s
% 0.07/0.34 % System time : 0.001 s
% 0.07/0.34 % Total time : 0.004 s
% 0.07/0.34 % Maximum resident set size: 3640 pages
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.003 s
% 0.07/0.34 % System time : 0.005 s
% 0.07/0.34 % Total time : 0.008 s
% 0.07/0.34 % Maximum resident set size: 4864 pages
% 0.07/0.34 % E exiting
%------------------------------------------------------------------------------