%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PUZ134_2 : TPTP v9.3.1. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n009.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 : Fri Sep 25 02:33:02 PM UTC 2026
% Result : Theorem 3.17s 1.31s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 28 unt; 0 typ; 2 def)
% Number of atoms : 165 ( 54 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 131 ( 48 ~; 69 |; 12 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 21 ( 21 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn 38 !; 1 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
age_of: knowheyan > age ).
tff(pred_def_1,type,
greater: ( age * age ) > $o ).
tff(func_def_2,type,
a: knowheyan ).
tff(func_def_3,type,
b: knowheyan ).
tff(func_def_4,type,
c: knowheyan ).
tff(func_def_5,type,
d: knowheyan ).
tff(func_def_6,type,
e: knowheyan ).
tff(func_def_7,type,
airfoil_technician: job ).
tff(func_def_8,type,
communications_consultant: job ).
tff(func_def_9,type,
space_planner: job ).
tff(func_def_10,type,
lunar_energy_engineer: job ).
tff(func_def_11,type,
synthetic_food_nutitionist: job ).
tff(func_def_12,type,
sK0: knowheyan ).
tff(f21,axiom,
! [X0: knowheyan] :
( ( X0 = e )
| ( X0 = d )
| ( X0 = c )
| ( X0 = b )
| ( X0 = a ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',only_knowheyans) ).
tff(f25,axiom,
! [X0: age,X1: age,X2: age] :
( ( greater(X1,X2)
& greater(X0,X1) )
=> greater(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_transitive) ).
tff(f26,axiom,
! [X0: age,X1: age] :
~ ( greater(X1,X0)
& greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_irreflexive) ).
tff(f27,axiom,
! [X0: age,X1: age] :
( ( X0 != X1 )
<=> ( greater(X1,X0)
| greater(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_greater) ).
tff(f29,axiom,
greater(age_of(a),age_of(d)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_info1) ).
tff(f30,axiom,
greater(age_of(d),age_of(b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_info2) ).
tff(f32,axiom,
greater(age_of(b),age_of(c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',age_info4) ).
tff(f35,axiom,
? [X0: knowheyan] : greater(age_of(c),age_of(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_not_youngest) ).
tff(f36,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/sandbox/benchmark/theBenchmark.p',age_order) ).
tff(f37,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(negated_conjecture,[status(cth)],[f36]) ).
tff(f40,plain,
! [X0: age,X1: age,X2: age] :
( ~ greater(X1,X2)
| ~ greater(X0,X1)
| greater(X0,X2) ),
inference(ennf_transformation,[],[f25]) ).
tff(f41,plain,
! [X0: age,X1: age,X2: age] :
( ~ greater(X1,X2)
| ~ greater(X0,X1)
| greater(X0,X2) ),
inference(flattening,[],[f40]) ).
tff(f42,plain,
! [X0: age,X1: age] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
tff(f49,plain,
( ~ 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(ennf_transformation,[],[f37]) ).
tff(f50,plain,
! [X0: age,X1: age] :
( ( ( X0 = X1 )
| greater(X1,X0)
| greater(X0,X1) )
& ( ( ~ greater(X1,X0)
& ~ greater(X0,X1) )
| ( X0 != X1 ) ) ),
inference(nnf_transformation,[],[f27]) ).
tff(f51,plain,
! [X0: age,X1: age] :
( ( ( X0 = X1 )
| greater(X1,X0)
| greater(X0,X1) )
& ( ( ~ greater(X1,X0)
& ~ greater(X0,X1) )
| ( X0 != X1 ) ) ),
inference(flattening,[],[f50]) ).
tff(f52,plain,
greater(age_of(c),age_of(sK0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f35]) ).
tff(f73,plain,
! [X0: knowheyan] :
( ( e = X0 )
| ( d = X0 )
| ( c = X0 )
| ( b = X0 )
| ( a = X0 ) ),
inference(cnf_transformation,[],[f21]) ).
tff(f77,plain,
! [X2: age,X0: age,X1: age] :
( ~ greater(X1,X2)
| ~ greater(X0,X1)
| greater(X0,X2) ),
inference(cnf_transformation,[],[f41]) ).
tff(f78,plain,
! [X0: age,X1: age] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
tff(f80,plain,
! [X0: age,X1: age] :
( ~ greater(X1,X0)
| ( X0 != X1 ) ),
inference(cnf_transformation,[],[f51]) ).
tff(f83,plain,
greater(age_of(a),age_of(d)),
inference(cnf_transformation,[],[f29]) ).
tff(f84,plain,
greater(age_of(d),age_of(b)),
inference(cnf_transformation,[],[f30]) ).
tff(f86,plain,
greater(age_of(b),age_of(c)),
inference(cnf_transformation,[],[f32]) ).
tff(f89,plain,
greater(age_of(c),age_of(sK0)),
inference(cnf_transformation,[],[f52]) ).
tff(f90,plain,
( ~ 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(cnf_transformation,[],[f49]) ).
tff(f92,plain,
! [X1: age] : ~ greater(X1,X1),
inference(equality_resolution,[],[f80]) ).
tcf(c_69,plain,
! [X0_knowheyan: knowheyan] :
( ( X0_knowheyan = e )
| ( X0_knowheyan = d )
| ( X0_knowheyan = c )
| ( X0_knowheyan = b )
| ( X0_knowheyan = a ) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_73,plain,
! [X0_age: age,X1_age: age,X2_age: age] :
( greater(X0_age,X2_age)
| ~ greater(X1_age,X2_age)
| ~ greater(X0_age,X1_age) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_74,plain,
! [X0_age: age,X1_age: age] :
( ~ greater(X1_age,X0_age)
| ~ greater(X0_age,X1_age) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_76,plain,
! [X0_age: age] : ~ greater(X0_age,X0_age),
inference(cnf_transformation,[],[f92]) ).
tcf(c_79,plain,
greater(age_of(a),age_of(d)),
inference(cnf_transformation,[],[f83]) ).
tcf(c_80,plain,
greater(age_of(d),age_of(b)),
inference(cnf_transformation,[],[f84]) ).
tcf(c_82,plain,
greater(age_of(b),age_of(c)),
inference(cnf_transformation,[],[f86]) ).
tcf(c_85,plain,
greater(age_of(c),age_of(sK0)),
inference(cnf_transformation,[],[f89]) ).
tcf(c_86,negated_conjecture,
( ~ greater(age_of(d),age_of(b))
| ~ greater(age_of(c),age_of(e))
| ~ greater(age_of(b),age_of(c))
| ~ greater(age_of(a),age_of(d)) ),
inference(cnf_transformation,[],[f90]) ).
tcf(c_97,negated_conjecture,
~ greater(age_of(c),age_of(e)),
inference(global_subsumption_just,[status(thm)],[c_86,c_82,c_80,c_79,c_86]) ).
tcf(c_455,definition,
iPr_def_10 = age_of(c),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_456,definition,
iPr_def_11 = age_of(e),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_457,negated_conjecture,
~ greater(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_97,c_456,c_455]) ).
tcf(c_725,plain,
greater(age_of(b),iPr_def_10),
inference(light_normalisation,[status(thm)],[c_82,c_455]) ).
tcf(c_746,plain,
greater(iPr_def_10,age_of(sK0)),
inference(light_normalisation,[status(thm)],[c_85,c_455]) ).
tcf(c_747,plain,
( greater(iPr_def_10,age_of(e))
| ( d = sK0 )
| ( c = sK0 )
| ( b = sK0 )
| ( a = sK0 ) ),
inference(superposition,[status(thm)],[c_69,c_746]) ).
tcf(c_748,plain,
( greater(iPr_def_10,iPr_def_11)
| ( d = sK0 )
| ( c = sK0 )
| ( b = sK0 )
| ( a = sK0 ) ),
inference(light_normalisation,[status(thm)],[c_747,c_456]) ).
tcf(c_749,plain,
( ( d = sK0 )
| ( c = sK0 )
| ( b = sK0 )
| ( a = sK0 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_748,c_457]) ).
tcf(c_764,plain,
~ greater(age_of(d),age_of(a)),
inference(superposition,[status(thm)],[c_79,c_74]) ).
tcf(c_766,plain,
~ greater(iPr_def_10,age_of(b)),
inference(superposition,[status(thm)],[c_725,c_74]) ).
tcf(c_767,plain,
~ greater(age_of(sK0),iPr_def_10),
inference(superposition,[status(thm)],[c_746,c_74]) ).
tcf(c_779,plain,
( greater(iPr_def_10,age_of(a))
| ( d = sK0 )
| ( c = sK0 )
| ( b = sK0 ) ),
inference(superposition,[status(thm)],[c_749,c_746]) ).
tcf(c_1123,plain,
! [X0_age: age] :
( greater(X0_age,iPr_def_10)
| ~ greater(X0_age,age_of(b)) ),
inference(superposition,[status(thm)],[c_725,c_73]) ).
tcf(c_1125,plain,
! [X0_age: age] :
( greater(X0_age,age_of(a))
| ( d = sK0 )
| ( c = sK0 )
| ( b = sK0 )
| ~ greater(X0_age,iPr_def_10) ),
inference(superposition,[status(thm)],[c_779,c_73]) ).
tcf(c_1176,plain,
greater(age_of(d),iPr_def_10),
inference(superposition,[status(thm)],[c_80,c_1123]) ).
tcf(c_1207,plain,
( ( d = sK0 )
| ( c = sK0 )
| ( b = sK0 )
| ~ greater(age_of(d),iPr_def_10) ),
inference(superposition,[status(thm)],[c_1125,c_764]) ).
tcf(c_1208,plain,
( ( d = sK0 )
| ( c = sK0 )
| ( b = sK0 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1207,c_1176]) ).
tcf(c_1294,plain,
( ( c = sK0 )
| ( b = sK0 )
| ~ greater(age_of(d),iPr_def_10) ),
inference(superposition,[status(thm)],[c_1208,c_767]) ).
tcf(c_1299,plain,
( ( c = sK0 )
| ( b = sK0 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1294,c_1176]) ).
tcf(c_1891,plain,
( greater(iPr_def_10,age_of(c))
| ( b = sK0 ) ),
inference(superposition,[status(thm)],[c_1299,c_746]) ).
tcf(c_1892,plain,
( greater(iPr_def_10,iPr_def_10)
| ( b = sK0 ) ),
inference(light_normalisation,[status(thm)],[c_1891,c_455]) ).
tcf(c_1893,plain,
b = sK0,
inference(forward_subsumption_resolution,[status(thm)],[c_1892,c_76]) ).
tcf(c_1899,plain,
greater(iPr_def_10,age_of(b)),
inference(demodulation,[status(thm)],[c_746,c_1893]) ).
tcf(c_1900,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1899,c_766]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ134_2 : TPTP v9.3.1. Released v5.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 07:00:13 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 3.17/1.31 % SZS status Started for theBenchmark.p
% 3.17/1.31 % SZS status Theorem for theBenchmark.p
% 3.17/1.31
% 3.17/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.17/1.31
% 3.17/1.31 % ------ iProver source info
% 3.17/1.31
% 3.17/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.17/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.17/1.31 % git: non_committed_changes: false
% 3.17/1.31
% 3.17/1.31 % ------ Parsing...
% 3.17/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 3.17/1.31 %
% 3.17/1.31
% 3.17/1.31 % ------ Preprocessing... sup_sim: 0 pe_s pe_e sup_sim: 0 pe_s pe_e %
% 3.17/1.31
% 3.17/1.31 % ------ Preprocessing...% ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 3.17/1.31 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e % ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 3.17/1.31 %
% 3.17/1.31
% 3.17/1.31 % ------ Preprocessing...
% 3.17/1.31 % ------ Proving...
% 3.17/1.31 % ------ Problem Properties
% 3.17/1.31
% 3.17/1.31 %
% 3.17/1.31 % clauses 39
% 3.17/1.31 % conjectures 1
% 3.17/1.31 % EPR 27
% 3.17/1.31 % Horn 36
% 3.17/1.31 % unary 28
% 3.17/1.31 % binary 5
% 3.17/1.31 % lits 60
% 3.17/1.31 % lits eq 43
% 3.17/1.31 % fd_pure 2
% 3.17/1.31 % fd_pseudo 0
% 3.17/1.31 % fd_cond 0
% 3.17/1.31 % fd_pseudo_cond 3
% 3.17/1.31 % AC symbols 0
% 3.17/1.31
% 3.17/1.31 % ------ Schedule dynamic 5 is on
% 3.17/1.31
% 3.17/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.17/1.31
% 3.17/1.31
% 3.17/1.31 % ------
% 3.17/1.31 % Current options:
% 3.17/1.31 % ------
% 3.17/1.31
% 3.17/1.31
% 3.17/1.31 %
% 3.17/1.31
% 3.17/1.31 % ------ Proving...
% 3.17/1.31 %
% 3.17/1.31
% 3.17/1.31 % SZS status Theorem for theBenchmark.p
% 3.17/1.31
% 3.17/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.17/1.31
% 3.17/1.31
%------------------------------------------------------------------------------