%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ134_2 : TPTP v9.3.1. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:58 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 97 ( 34 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 89 ( 34 ~; 42 |; 10 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn 29 !; 1 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
knowheyan: $tType ).
tff(decl_sort2,type,
age: $tType ).
tff(decl_23,type,
age_of: knowheyan > age ).
tff(decl_25,type,
greater: ( age * age ) > $o ).
tff(decl_26,type,
a: knowheyan ).
tff(decl_27,type,
b: knowheyan ).
tff(decl_28,type,
c: knowheyan ).
tff(decl_29,type,
d: knowheyan ).
tff(decl_30,type,
e: knowheyan ).
tff(decl_36,type,
esk1_0: knowheyan ).
tff(age_order,conjecture,
( greater(age_of(c),age_of(e))
& greater(age_of(b),age_of(c))
& greater(age_of(d),age_of(b))
& greater(age_of(a),age_of(d)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',age_order) ).
tff(age_transitive,axiom,
! [X4: age,X5: age,X6: age] :
( ( greater(X5,X6)
& greater(X4,X5) )
=> greater(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',age_transitive) ).
tff(age_irreflexive,axiom,
! [X7: age,X8: age] :
~ ( greater(X8,X7)
& greater(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',age_irreflexive) ).
tff(c_not_youngest,axiom,
? [X1: knowheyan] : greater(age_of(c),age_of(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_not_youngest) ).
tff(only_knowheyans,axiom,
! [X1: knowheyan] :
( ( X1 = e )
| ( X1 = d )
| ( X1 = c )
| ( X1 = b )
| ( X1 = a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',only_knowheyans) ).
tff(age_info1,axiom,
greater(age_of(a),age_of(d)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',age_info1) ).
tff(age_info4,axiom,
greater(age_of(b),age_of(c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',age_info4) ).
tff(age_info2,axiom,
greater(age_of(d),age_of(b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',age_info2) ).
tff(age_greater,axiom,
! [X9: age,X10: age] :
( ( X9 != X10 )
<=> ( greater(X10,X9)
| greater(X9,X10) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',age_greater) ).
tff(c_0_9,negated_conjecture,
~ ( greater(age_of(c),age_of(e))
& greater(age_of(b),age_of(c))
& greater(age_of(d),age_of(b))
& greater(age_of(a),age_of(d)) ),
inference(assume_negation,[status(cth)],[age_order]) ).
tff(c_0_10,negated_conjecture,
( ~ greater(age_of(c),age_of(e))
| ~ greater(age_of(b),age_of(c))
| ~ greater(age_of(d),age_of(b))
| ~ greater(age_of(a),age_of(d)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
tff(c_0_11,plain,
! [X17: age,X18: age,X19: age] :
( greater(X17,X19)
| ~ greater(X18,X19)
| ~ greater(X17,X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[age_transitive])])]) ).
tff(c_0_12,plain,
! [X20: age,X21: age] :
( ~ greater(X21,X20)
| ~ greater(X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[age_irreflexive])])]) ).
tff(c_0_13,plain,
greater(age_of(c),age_of(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_not_youngest])]) ).
tff(c_0_14,plain,
! [X11: knowheyan] :
( ( X11 = e )
| ( X11 = d )
| ( X11 = c )
| ( X11 = b )
| ( X11 = a ) ),
inference(variable_rename,[status(thm)],[only_knowheyans]) ).
tcf(c_0_15,negated_conjecture,
( ~ greater(age_of(c),age_of(e))
| ~ greater(age_of(b),age_of(c))
| ~ greater(age_of(d),age_of(b))
| ~ greater(age_of(a),age_of(d)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_16,plain,
greater(age_of(a),age_of(d)),
inference(split_conjunct,[status(thm)],[age_info1]) ).
tcf(c_0_17,plain,
greater(age_of(b),age_of(c)),
inference(split_conjunct,[status(thm)],[age_info4]) ).
tcf(c_0_18,plain,
greater(age_of(d),age_of(b)),
inference(split_conjunct,[status(thm)],[age_info2]) ).
tcf(c_0_19,plain,
! [X4: age,X5: age,X6: age] :
( ~ greater(X5,X6)
| ~ greater(X4,X5)
| greater(X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_20,plain,
! [X5: age,X4: age] :
( ~ greater(X5,X4)
| ~ greater(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_21,plain,
greater(age_of(c),age_of(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_22,plain,
! [X1: knowheyan] :
( ( X1 = e )
| ( X1 = d )
| ( X1 = c )
| ( X1 = b )
| ( X1 = a ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_23,negated_conjecture,
~ greater(age_of(c),age_of(e)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
tcf(c_0_24,plain,
! [X4: age] :
( ~ greater(X4,age_of(d))
| greater(X4,age_of(b)) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
tff(c_0_25,plain,
! [X9: age,X10: age] :
( ( X9 != X10 )
<=> ( greater(X10,X9)
| greater(X9,X10) ) ),
inference(fof_simplification,[status(thm)],[age_greater]) ).
tcf(c_0_26,plain,
~ greater(age_of(esk1_0),age_of(c)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
tcf(c_0_27,plain,
( ( esk1_0 = a )
| ( esk1_0 = b )
| ( esk1_0 = c )
| ( esk1_0 = d ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
tcf(c_0_28,plain,
! [X4: age] :
( ~ greater(X4,age_of(b))
| greater(X4,age_of(c)) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
tcf(c_0_29,plain,
greater(age_of(a),age_of(b)),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
tff(c_0_30,plain,
! [X22: age,X23: age] :
( ( ( X22 != X23 )
| ~ greater(X23,X22) )
& ( ( X22 != X23 )
| ~ greater(X22,X23) )
& ( greater(X23,X22)
| greater(X22,X23)
| ( X22 = X23 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
tcf(c_0_31,plain,
( ~ greater(age_of(a),age_of(c))
| ( esk1_0 = d )
| ( esk1_0 = c )
| ( esk1_0 = b ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
tcf(c_0_32,plain,
greater(age_of(a),age_of(c)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
tcf(c_0_33,plain,
! [X5: age,X4: age] :
( ( X5 != X4 )
| ~ greater(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
tcf(c_0_34,plain,
( ( esk1_0 = b )
| ( esk1_0 = c )
| ( esk1_0 = d ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
tcf(c_0_35,plain,
! [X4: age] : ~ greater(X4,X4),
inference(er,[status(thm)],[c_0_33]) ).
tcf(c_0_36,plain,
greater(age_of(d),age_of(c)),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
tcf(c_0_37,plain,
( ( esk1_0 = d )
| ( esk1_0 = b ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_34]),c_0_35]) ).
tcf(c_0_38,plain,
~ greater(age_of(c),age_of(d)),
inference(spm,[status(thm)],[c_0_20,c_0_36]) ).
tcf(c_0_39,plain,
esk1_0 = b,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_37]),c_0_38]) ).
tcf(c_0_40,plain,
~ greater(age_of(c),age_of(b)),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ134_2 : TPTP v9.3.1. Released v5.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n003.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.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 03:54:30 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3349518 completed with status 0
% 0.13/0.42 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.42 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSF-FFMS11-SFFFFFNN
% 0.13/0.42 % partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.42 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 189s (1) cores
% 0.13/0.42 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.13/0.42 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3349525 completed with status 0
% 0.13/0.42 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.13/0.42 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSF-FFMS11-SFFFFFNN
% 0.13/0.42 % partial match(1): FGHSF-FFMS31-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42 % Presaturation interreduction done
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 52
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 54
% 0.13/0.42 % Removed in clause preprocessing : 16
% 0.13/0.42 % Initial clauses in saturation : 38
% 0.13/0.42 % Processed clauses : 107
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 11
% 0.13/0.42 % ...remaining for further processing : 96
% 0.13/0.42 % Other redundant clauses eliminated : 2
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 2
% 0.13/0.42 % Backward-rewritten : 2
% 0.13/0.42 % Generated clauses : 106
% 0.13/0.42 % ...of the previous two non-redundant : 69
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 77
% 0.13/0.42 % Factorizations : 24
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 4
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 12
% 0.13/0.42 % ...of those cached : 5
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 52
% 0.13/0.42 % Positive orientable unit clauses : 8
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 29
% 0.13/0.42 % Non-unit-clauses : 15
% 0.13/0.42 % Current number of unprocessed clauses: 37
% 0.13/0.42 % ...number of literals in the above : 158
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 42
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 50
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 26
% 0.13/0.42 % Non-unit clause-clause subsumptions : 6
% 0.13/0.42 % Unit Clause-clause subsumption calls : 37
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 2
% 0.13/0.42 % BW rewrite match successes : 2
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 2444
% 0.13/0.42 % Search garbage collected termcells : 226
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.005 s
% 0.13/0.42 % System time : 0.004 s
% 0.13/0.42 % Total time : 0.009 s
% 0.13/0.42 % Maximum resident set size: 3660 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.019 s
% 0.13/0.42 % System time : 0.012 s
% 0.13/0.42 % Total time : 0.031 s
% 0.13/0.42 % Maximum resident set size: 4608 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------