%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU196+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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 08:45:22 AM UTC 2026
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 31 ( 13 ~; 8 |; 3 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 4 sgn 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(dt_k7_relat_1,axiom,
! [A,B] :
( relation(A)
=> relation(relation_dom_restriction(A,B)) ),
file('theBenchmark.p',dt_k7_relat_1) ).
fof(t25_relat_1,axiom,
! [A] :
( relation(A)
=> ! [B] :
( relation(B)
=> ( subset(A,B)
=> ( subset(relation_rng(A),relation_rng(B))
& subset(relation_dom(A),relation_dom(B)) ) ) ) ),
file('theBenchmark.p',t25_relat_1) ).
fof(t88_relat_1,axiom,
! [A,B] :
( relation(B)
=> subset(relation_dom_restriction(B,A),B) ),
file('theBenchmark.p',t88_relat_1) ).
fof(t99_relat_1,conjecture,
! [A,B] :
( relation(B)
=> subset(relation_rng(relation_dom_restriction(B,A)),relation_rng(B)) ),
file('theBenchmark.p',t99_relat_1) ).
fof(t99_relat_1_neg,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> subset(relation_rng(relation_dom_restriction(B,A)),relation_rng(B)) ),
inference(assume_negation,[status(cth)],[t99_relat_1]) ).
cnf(c_36,plain,
( relation(relation_dom_restriction(A,B))
| ~ relation(A) ),
inference(clausify,[status(thm)],[dt_k7_relat_1]) ).
cnf(c_60,plain,
( subset(relation_rng(A),relation_rng(B))
| ~ subset(A,B)
| ~ relation(B)
| ~ relation(A) ),
inference(clausify,[status(thm)],[t25_relat_1]) ).
cnf(c_68,plain,
( subset(relation_dom_restriction(A,B),A)
| ~ relation(A) ),
inference(clausify,[status(thm)],[t88_relat_1]) ).
fof(nnf_33,plain,
? [A,B] :
( ~ subset(relation_rng(relation_dom_restriction(B,A)),relation_rng(B))
& relation(B) ),
inference(fof_nnf,[status(thm)],[t99_relat_1_neg]) ).
fof(sk_t99_relat_1_neg,plain,
( ~ subset(relation_rng(relation_dom_restriction(sK0,sK1)),relation_rng(sK0))
& relation(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK1),skolemize(B,sK0)],[nnf_33]) ).
cnf(c_70,negated_conjecture,
relation(sK0),
inference(split_conjunct,[status(thm)],[sk_t99_relat_1_neg]) ).
cnf(c_71,negated_conjecture,
~ subset(relation_rng(relation_dom_restriction(sK0,sK1)),relation_rng(sK0)),
inference(split_conjunct,[status(thm)],[sk_t99_relat_1_neg]) ).
cnf(c_123,plain,
subset(relation_dom_restriction(sK0,A),sK0),
inference(resolve,[status(thm)],[c_70,c_68]) ).
cnf(c_126,plain,
relation(relation_dom_restriction(sK0,A)),
inference(resolve,[status(thm)],[c_70,c_36]) ).
cnf(c_175,plain,
( subset(relation_rng(relation_dom_restriction(sK0,B)),relation_rng(A))
| ~ subset(relation_dom_restriction(sK0,B),A)
| ~ relation(A) ),
inference(resolve,[status(thm)],[c_60,c_126]) ).
cnf(c_176,negated_conjecture,
( subset(relation_rng(relation_dom_restriction(sK0,A)),relation_rng(sK0))
| ~ subset(relation_dom_restriction(sK0,A),sK0) ),
inference(resolve,[status(thm)],[c_175,c_70]) ).
cnf(c_177,negated_conjecture,
~ subset(relation_dom_restriction(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_176,c_71]) ).
cnf(c_174,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_123,c_177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU196+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 % Computer : n007.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sat Sep 26 08:45:55 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.46 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.46 % Process 3337174 was started by sandbox2 on n007,
% 0.19/0.46 % Sat Sep 26 08:45:55 2026
% 0.19/0.46 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.19/0.47
% 0.19/0.47 % From the command line: assign(max_seconds, 300).
% 0.19/0.50
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50
% 0.19/0.50 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.19/0.50 % Length of proof is 12.
% 0.19/0.50 % Level of proof is 3.
% 0.19/0.50 % Maximum clause weight is 12.000.
% 0.19/0.50 % Given clauses 65.
% 0.19/0.50
% 0.19/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------