%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET687+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:36:49 AM UTC 2026
% Result : Theorem 0.08s 0.38s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 35 ( 15 ~; 12 |; 6 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('theBenchmark.p',subset) ).
fof(thI01,conjecture,
! [A] : subset(A,A),
file('theBenchmark.p',thI01) ).
fof(thI01_neg,negated_conjecture,
~ ! [A] : subset(A,A),
inference(assume_negation,[status(cth)],[thI01]) ).
fof(nnf_12,plain,
? [A] : ~ subset(A,A),
inference(fof_nnf,[status(thm)],[thI01_neg]) ).
fof(sk_thI01_neg,plain,
~ subset(sK0,sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(A,sK0)],[nnf_12]) ).
cnf(c_16,negated_conjecture,
~ subset(sK0,sK0),
inference(split_conjunct,[status(thm)],[sk_thI01_neg]) ).
fof(nnf_1,plain,
! [A,B] :
( ( ? [X] :
( ~ member(X,B)
& member(X,A) )
| subset(A,B) )
& ( ! [X0] :
( member(X0,B)
| ~ member(X0,A) )
| ~ subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[subset]) ).
fof(sk_subset_sk,plain,
! [A,B] :
( ( ( ~ member(sK1(A,B),B)
& member(sK1(A,B),A) )
| subset(A,B) )
& ( ! [X0] :
( member(X0,B)
| ~ member(X0,A) )
| ~ subset(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X,sK1(A,B))],[nnf_1]) ).
fof(sk_subset,plain,
( ! [VAR_0,VAR_1] :
( ~ member(sK1(VAR_0,VAR_1),VAR_1)
| subset(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( member(sK1(VAR_0,VAR_1),VAR_0)
| subset(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1,VAR_2] :
( member(VAR_2,VAR_1)
| ~ member(VAR_2,VAR_0)
| ~ subset(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_subset_sk]) ).
cnf(c_40,plain,
( ~ member(sK1(A,B),B)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_subset]) ).
cnf(c_41,plain,
( member(sK1(A,B),A)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_subset]) ).
cnf(c_78,negated_conjecture,
~ member(sK1(sK0,sK0),sK0),
inference(resolve,[status(thm)],[c_40,c_16]) ).
cnf(c_81,negated_conjecture,
member(sK1(sK0,sK0),sK0),
inference(resolve,[status(thm)],[c_41,c_16]) ).
cnf(c_80,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_78,c_81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET687+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n011.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 08:05:29 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 4178346 was started by sandbox2 on n011,
% 0.08/0.36 % Sat Sep 26 08:05:29 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 0.08/0.38
% 0.08/0.38 % SZS status Theorem for theBenchmark
% 0.08/0.38
% 0.08/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.38 % Length of proof is 7.
% 0.08/0.38 % Level of proof is 3.
% 0.08/0.38 % Maximum clause weight is 8.000.
% 0.08/0.38 % Given clauses 26.
% 0.08/0.38
% 0.08/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------