%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR147+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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 : Sun Sep 27 07:08:03 AM UTC 2026
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 20 unt; 0 def)
% Number of atoms : 46 ( 2 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 16 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 7 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(experience,axiom,
! [O,OAge,YAge] :
( s__Human(O)
=> ( ( greater(OAge,YAge)
& s__age(s__siblingFn(O),YAge)
& s__age(O,OAge) )
=> ( s__has_seen_more(s__siblingFn(O),O)
| s__more_experienced(O,s__siblingFn(O)) ) ) ),
file('theBenchmark.p',experience) ).
fof(jim_is_experienced,conjecture,
s__more_experienced(jim,geoff),
file('theBenchmark.p',jim_is_experienced) ).
fof(jim_is_experienced_neg,negated_conjecture,
~ s__more_experienced(jim,geoff),
inference(assume_negation,[status(cth)],[jim_is_experienced]) ).
cnf(c_8,plain,
( s__has_seen_more(s__siblingFn(A),A)
| s__more_experienced(A,s__siblingFn(A))
| ~ greater(B,C)
| ~ s__age(s__siblingFn(A),C)
| ~ s__age(A,B)
| ~ s__Human(A) ),
inference(clausify,[status(thm)],[experience]) ).
fof(greater_54_48,axiom,
greater(n54,n48),
file('theBenchmark.p',greater_54_48) ).
cnf(c_9,plain,
greater(n54,n48),
inference(clausify,[status(thm)],[greater_54_48]) ).
cnf(c_10,plain,
( s__has_seen_more(s__siblingFn(A),A)
| s__more_experienced(A,s__siblingFn(A))
| ~ s__age(s__siblingFn(A),n48)
| ~ s__age(A,n54)
| ~ s__Human(A) ),
inference(resolve,[status(thm)],[c_8,c_9]) ).
fof(jim_human,axiom,
s__Human(jim),
file('theBenchmark.p',jim_human) ).
cnf(c_13,plain,
s__Human(jim),
inference(clausify,[status(thm)],[jim_human]) ).
fof(geoff_48,axiom,
s__age(geoff,n48),
file('theBenchmark.p',geoff_48) ).
cnf(c_16,plain,
s__age(geoff,n48),
inference(clausify,[status(thm)],[geoff_48]) ).
fof(jim_54,axiom,
s__age(jim,n54),
file('theBenchmark.p',jim_54) ).
cnf(c_17,plain,
s__age(jim,n54),
inference(clausify,[status(thm)],[jim_54]) ).
fof(geoff_and_jim,axiom,
geoff = s__siblingFn(jim),
file('theBenchmark.p',geoff_and_jim) ).
cnf(c_18,plain,
geoff = s__siblingFn(jim),
inference(clausify,[status(thm)],[geoff_and_jim]) ).
fof(jim_has_seen_more,axiom,
~ s__has_seen_more(geoff,jim),
file('theBenchmark.p',jim_has_seen_more) ).
cnf(c_19,plain,
~ s__has_seen_more(geoff,jim),
inference(clausify,[status(thm)],[jim_has_seen_more]) ).
cnf(c_20,plain,
~ s__has_seen_more(s__siblingFn(jim),jim),
inference(paramod,[status(thm)],[c_18,c_19]) ).
cnf(c_21,negated_conjecture,
~ s__more_experienced(jim,geoff),
inference(clausify,[status(thm)],[jim_is_experienced_neg]) ).
cnf(c_22,negated_conjecture,
~ s__more_experienced(jim,s__siblingFn(jim)),
inference(paramod,[status(thm)],[c_18,c_21]) ).
cnf(c_23,plain,
s__age(s__siblingFn(jim),n48),
inference(paramod,[status(thm)],[c_18,c_16]) ).
cnf(c_31,plain,
( s__has_seen_more(s__siblingFn(jim),jim)
| s__more_experienced(jim,s__siblingFn(jim))
| ~ s__age(s__siblingFn(jim),n48)
| ~ s__age(jim,n54) ),
inference(resolve,[status(thm)],[c_10,c_13]) ).
cnf(c_32,plain,
( s__has_seen_more(s__siblingFn(jim),jim)
| s__more_experienced(jim,s__siblingFn(jim))
| ~ s__age(s__siblingFn(jim),n48) ),
inference(resolve,[status(thm)],[c_31,c_17]) ).
cnf(c_33,negated_conjecture,
( s__has_seen_more(s__siblingFn(jim),jim)
| ~ s__age(s__siblingFn(jim),n48) ),
inference(resolve,[status(thm)],[c_32,c_22]) ).
cnf(c_34,negated_conjecture,
~ s__age(s__siblingFn(jim),n48),
inference(resolve,[status(thm)],[c_33,c_20]) ).
cnf(c_30,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_23,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR147+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n007.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 : Sun Sep 27 01:17:10 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36 % Process 920040 was started by sandbox on n007,
% 0.12/0.36 % Sun Sep 27 01:17:10 2026
% 0.12/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.36
% 0.12/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.37
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37
% 0.12/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.37 % Length of proof is 15.
% 0.12/0.37 % Level of proof is 3.
% 0.12/0.37 % Maximum clause weight is 17.000.
% 0.12/0.37 % Given clauses 9.
% 0.12/0.37
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------