%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET809+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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 08:37:00 AM UTC 2026
% Result : Theorem 0.23s 11.03s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 67 ( 27 ~; 17 |; 12 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 36 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ordinal_number,axiom,
! [A] :
( member(A,on)
<=> ( ! [X] :
( member(X,A)
=> subset(X,A) )
& strict_well_order(member_predicate,A)
& set(A) ) ),
file('theBenchmark.p',ordinal_number) ).
fof(strict_well_order,axiom,
! [R,E] :
( strict_well_order(R,E)
<=> ( ! [A] :
( ( ? [X] : member(X,A)
& subset(A,E) )
=> ? [Y] : least(Y,R,A) )
& strict_order(R,E) ) ),
file('theBenchmark.p',strict_well_order) ).
fof(rel_member,axiom,
! [X,Y] :
( apply(member_predicate,X,Y)
<=> member(X,Y) ),
file('theBenchmark.p',rel_member) ).
fof(strict_order,axiom,
! [R,E] :
( strict_order(R,E)
<=> ( ! [X,Y,Z] :
( ( member(Z,E)
& member(Y,E)
& member(X,E) )
=> ( ( apply(R,Y,Z)
& apply(R,X,Y) )
=> apply(R,X,Z) ) )
& ! [X,Y] :
( ( member(Y,E)
& member(X,E) )
=> ~ ( apply(R,Y,X)
& apply(R,X,Y) ) ) ) ),
file('theBenchmark.p',strict_order) ).
fof(thV2,conjecture,
! [A] :
( member(A,on)
=> ~ member(A,A) ),
file('theBenchmark.p',thV2) ).
fof(thV2_neg,negated_conjecture,
~ ! [A] :
( member(A,on)
=> ~ member(A,A) ),
inference(assume_negation,[status(cth)],[thV2]) ).
cnf(c_49,plain,
( ~ apply(A,D,C)
| ~ apply(A,C,D)
| ~ member(D,B)
| ~ member(C,B)
| ~ strict_order(A,B) ),
inference(clausify,[status(thm)],[strict_order]) ).
cnf(c_53,plain,
( strict_order(A,B)
| ~ strict_well_order(A,B) ),
inference(clausify,[status(thm)],[strict_well_order]) ).
cnf(c_55,plain,
( ~ apply(A,D,C)
| ~ apply(A,C,D)
| ~ member(D,B)
| ~ member(C,B)
| ~ strict_well_order(A,B) ),
inference(resolve,[status(thm)],[c_53,c_49]) ).
cnf(c_203,plain,
( strict_well_order(member_predicate,A)
| ~ member(A,on) ),
inference(clausify,[status(thm)],[ordinal_number]) ).
cnf(c_215,plain,
( ~ member(A,B)
| apply(member_predicate,A,B) ),
inference(clausify,[status(thm)],[rel_member]) ).
fof(nnf_20,plain,
? [A] :
( member(A,A)
& member(A,on) ),
inference(fof_nnf,[status(thm)],[thV2_neg]) ).
fof(sk_thV2_neg,plain,
( member(sK0,sK0)
& member(sK0,on) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(A,sK0)],[nnf_20]) ).
cnf(c_222,negated_conjecture,
member(sK0,on),
inference(split_conjunct,[status(thm)],[sk_thV2_neg]) ).
cnf(c_223,negated_conjecture,
member(sK0,sK0),
inference(split_conjunct,[status(thm)],[sk_thV2_neg]) ).
cnf(c_1216,plain,
strict_well_order(member_predicate,sK0),
inference(resolve,[status(thm)],[c_222,c_203]) ).
cnf(c_1270,plain,
apply(member_predicate,sK0,sK0),
inference(resolve,[status(thm)],[c_223,c_215]) ).
cnf(c_1304,plain,
( ~ apply(A,sK0,B)
| ~ apply(A,B,sK0)
| ~ member(B,sK0)
| ~ strict_well_order(A,sK0) ),
inference(resolve,[status(thm)],[c_223,c_55]) ).
cnf(c_1478,plain,
( ~ apply(A,sK0,sK0)
| ~ member(sK0,sK0)
| ~ strict_well_order(A,sK0) ),
inference(factor,[status(thm)],[c_1304]) ).
cnf(c_1326,negated_conjecture,
( ~ apply(A,sK0,sK0)
| ~ strict_well_order(A,sK0) ),
inference(resolve,[status(thm)],[c_223,c_1478]) ).
cnf(c_1479,plain,
~ apply(member_predicate,sK0,sK0),
inference(resolve,[status(thm)],[c_1216,c_1326]) ).
cnf(c_1477,plain,
$false,
inference(resolve,[status(thm)],[c_1270,c_1479]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET809+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/10.44 % Computer : n004.cluster.edu
% 0.18/10.44 % Model : x86_64 x86_64
% 0.18/10.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/10.44 % Memory : 8046.5625MB
% 0.18/10.44 % OS : Linux 6.8.0-71-generic
% 0.18/10.45 % CPULimit : 300
% 0.18/10.45 % WCLimit : 300
% 0.18/10.45 % DateTime : Sat Sep 26 08:17:18 UTC 2026
% 0.18/10.45 % CPUTime :
% 0.18/10.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/10.45 % Process 1216538 was started by sandbox2 on n004,
% 0.18/10.45 % Sat Sep 26 08:17:18 2026
% 0.18/10.45 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/10.47
% 0.18/10.47 % From the command line: assign(max_seconds, 300).
% 0.23/11.03
% 0.23/11.03 % SZS status Theorem for theBenchmark
% 0.23/11.03
% 0.23/11.03 % Proof 1 at 0.36 (+ 0.16) seconds.
% 0.23/11.03 % Length of proof is 17.
% 0.23/11.03 % Level of proof is 5.
% 0.23/11.03 % Maximum clause weight is 19.000.
% 0.23/11.03 % Given clauses 240.
% 0.23/11.03
% 0.23/11.03 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------