%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET055-7 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.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:35:31 AM UTC 2026
% Result : Unsatisfiable 0.14s 10.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 6 unt; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subclass_implies_equal,axiom,
! [VAR_0,VAR_1] :
( equalish(VAR_0,VAR_1)
| ~ subclass(VAR_1,VAR_0)
| ~ subclass(VAR_0,VAR_1) ),
file('theBenchmark.p',subclass_implies_equal) ).
cnf(c_74,plain,
( equalish(A,B)
| ~ subclass(B,A)
| ~ subclass(A,B) ),
inference(clausify,[status(thm)],[subclass_implies_equal]) ).
fof(subclass_is_reflexive,axiom,
! [VAR_0] : subclass(VAR_0,VAR_0),
file('theBenchmark.p',subclass_is_reflexive) ).
cnf(c_163,plain,
subclass(A,A),
inference(clausify,[status(thm)],[subclass_is_reflexive]) ).
fof(prove_reflexivity,axiom,
~ equalish(x,x),
file('theBenchmark.p',prove_reflexivity) ).
cnf(c_165,plain,
~ equalish(x,x),
inference(clausify,[status(thm)],[prove_reflexivity]) ).
cnf(c_168,plain,
( equalish(A,A)
| ~ subclass(A,A) ),
inference(factor,[status(thm)],[c_74]) ).
cnf(c_166,plain,
equalish(A,A),
inference(resolve,[status(thm)],[c_163,c_168]) ).
cnf(c_167,plain,
$false,
inference(resolve,[status(thm)],[c_166,c_165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET055-7 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/10.37 % Computer : n013.cluster.edu
% 0.10/10.37 % Model : x86_64 x86_64
% 0.10/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.37 % Memory : 8046.5625MB
% 0.10/10.37 % OS : Linux 6.8.0-71-generic
% 0.10/10.37 % CPULimit : 300
% 0.10/10.37 % WCLimit : 300
% 0.10/10.37 % DateTime : Sat Sep 26 07:00:03 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/10.38 % Process 2167533 was started by sandbox on n013,
% 0.10/10.38 % Sat Sep 26 07:00:03 2026
% 0.10/10.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/10.38
% 0.10/10.38 % From the command line: assign(max_seconds, 300).
% 0.14/10.40
% 0.14/10.40 % SZS status Unsatisfiable for theBenchmark
% 0.14/10.40
% 0.14/10.40 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.14/10.40 % Length of proof is 5.
% 0.14/10.40 % Level of proof is 2.
% 0.14/10.40 % Maximum clause weight is 14.000.
% 0.14/10.40 % Given clauses 0.
% 0.14/10.40
% 0.14/10.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------