%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET296-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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:10 AM UTC 2026
% Result : Unsatisfiable 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 7 unt; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 3 ( 0 sgn 1 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_domain_of_inverse_1,axiom,
domain_of(inverse(x)) != range_of(x),
file('theBenchmark.p',prove_domain_of_inverse_1) ).
cnf(c_36,plain,
domain_of(inverse(x)) != range_of(x),
inference(clausify,[status(thm)],[prove_domain_of_inverse_1]) ).
fof(range_of,axiom,
! [VAR_0] : domain_of(inverse(VAR_0)) = range_of(VAR_0),
file('theBenchmark.p',range_of) ).
cnf(c_98,plain,
domain_of(inverse(A)) = range_of(A),
inference(clausify,[status(thm)],[range_of]) ).
cnf(c_99,plain,
range_of(A) = domain_of(inverse(A)),
inference(copy,[status(thm)],[c_98]) ).
cnf(c_101,plain,
range_of(x) != domain_of(inverse(x)),
inference(copy,[status(thm)],[c_36]) ).
cnf(c_100,plain,
$false,
inference(resolve,[status(thm)],[c_99,c_101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET296-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.40 % Computer : n017.cluster.edu
% 0.16/0.40 % Model : x86_64 x86_64
% 0.16/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40 % Memory : 8046.5625MB
% 0.16/0.40 % OS : Linux 6.8.0-71-generic
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Sat Sep 26 07:22:49 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.41 % Process 143864 was started by sandbox2 on n017,
% 0.16/0.41 % Sat Sep 26 07:22:49 2026
% 0.16/0.41 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/0.41
% 0.16/0.41 % From the command line: assign(max_seconds, 300).
% 0.16/0.43
% 0.16/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.43
% 0.16/0.43 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.16/0.43 % Length of proof is 4.
% 0.16/0.43 % Level of proof is 2.
% 0.16/0.43 % Maximum clause weight is 21.000.
% 0.16/0.43 % Given clauses 0.
% 0.16/0.43
% 0.16/0.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------