%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU247+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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:45:34 AM UTC 2026
% Result : Theorem 0.06s 0.42s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 23 ( 13 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 2 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t140_relat_1,axiom,
! [A,B,C] :
( relation(C)
=> relation_dom_restriction(relation_rng_restriction(A,C),B) = relation_rng_restriction(A,relation_dom_restriction(C,B)) ),
file('theBenchmark.p',t140_relat_1) ).
fof(t17_wellord1,axiom,
! [A,B] :
( relation(B)
=> relation_restriction(B,A) = relation_dom_restriction(relation_rng_restriction(A,B),A) ),
file('theBenchmark.p',t17_wellord1) ).
fof(t18_wellord1,conjecture,
! [A,B] :
( relation(B)
=> relation_restriction(B,A) = relation_rng_restriction(A,relation_dom_restriction(B,A)) ),
file('theBenchmark.p',t18_wellord1) ).
fof(t18_wellord1_neg,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> relation_restriction(B,A) = relation_rng_restriction(A,relation_dom_restriction(B,A)) ),
inference(assume_negation,[status(cth)],[t18_wellord1]) ).
cnf(c_19,plain,
( relation_rng_restriction(B,relation_dom_restriction(A,C)) = relation_dom_restriction(relation_rng_restriction(B,A),C)
| ~ relation(A) ),
inference(clausify,[status(thm)],[t140_relat_1]) ).
cnf(c_20,plain,
( relation_dom_restriction(relation_rng_restriction(B,A),B) = relation_restriction(A,B)
| ~ relation(A) ),
inference(clausify,[status(thm)],[t17_wellord1]) ).
fof(nnf_11,plain,
? [A,B] :
( relation_rng_restriction(A,relation_dom_restriction(B,A)) != relation_restriction(B,A)
& relation(B) ),
inference(fof_nnf,[status(thm)],[t18_wellord1_neg]) ).
fof(sk_t18_wellord1_neg,plain,
( relation_rng_restriction(sK1,relation_dom_restriction(sK0,sK1)) != relation_restriction(sK0,sK1)
& relation(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK1),skolemize(B,sK0)],[nnf_11]) ).
cnf(c_21,negated_conjecture,
relation(sK0),
inference(split_conjunct,[status(thm)],[sk_t18_wellord1_neg]) ).
cnf(c_22,negated_conjecture,
relation_rng_restriction(sK1,relation_dom_restriction(sK0,sK1)) != relation_restriction(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_t18_wellord1_neg]) ).
cnf(c_23,negated_conjecture,
relation_dom_restriction(relation_rng_restriction(A,sK0),A) = relation_restriction(sK0,A),
inference(resolve,[status(thm)],[c_20,c_21]) ).
cnf(c_24,negated_conjecture,
relation_rng_restriction(A,relation_dom_restriction(sK0,B)) = relation_dom_restriction(relation_rng_restriction(A,sK0),B),
inference(resolve,[status(thm)],[c_19,c_21]) ).
cnf(c_30,negated_conjecture,
relation_dom_restriction(relation_rng_restriction(sK1,sK0),sK1) != relation_restriction(sK0,sK1),
inference(paramod,[status(thm)],[c_24,c_22]) ).
cnf(c_31,negated_conjecture,
relation_restriction(sK0,sK1) != relation_restriction(sK0,sK1),
inference(paramod,[status(thm)],[c_23,c_30]) ).
cnf(c_29,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU247+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38 % Computer : n011.cluster.edu
% 0.06/0.38 % Model : x86_64 x86_64
% 0.06/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.38 % Memory : 8046.5625MB
% 0.06/0.38 % OS : Linux 6.8.0-71-generic
% 0.06/0.38 % CPULimit : 300
% 0.06/0.38 % WCLimit : 300
% 0.06/0.38 % DateTime : Sat Sep 26 08:58:14 UTC 2026
% 0.06/0.39 % CPUTime :
% 0.06/0.39 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.06/0.39 % Process 116934 was started by sandbox on n011,
% 0.06/0.39 % Sat Sep 26 08:58:14 2026
% 0.06/0.39 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.06/0.39
% 0.06/0.39 % From the command line: assign(max_seconds, 300).
% 0.06/0.42
% 0.06/0.42 % SZS status Theorem for theBenchmark
% 0.06/0.42
% 0.06/0.42 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.06/0.42 % Length of proof is 10.
% 0.06/0.42 % Level of proof is 3.
% 0.06/0.42 % Maximum clause weight is 28.000.
% 0.06/0.42 % Given clauses 9.
% 0.06/0.42
% 0.06/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------