%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET148-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 : n006.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:54 AM UTC 2026
% Result : Unsatisfiable 11.11s 2.01s
% Output : CNFRefutation 11.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 42 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 16 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 39 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_idempotency_of_intersection_1,axiom,
intersection(x,x) != x,
file('theBenchmark.p',prove_idempotency_of_intersection_1) ).
cnf(c_36,plain,
intersection(x,x) != x,
inference(clausify,[status(thm)],[prove_idempotency_of_intersection_1]) ).
fof(intersection3,axiom,
! [VAR_0,VAR_1,VAR_2] :
( member(VAR_0,intersection(VAR_1,VAR_2))
| ~ member(VAR_0,VAR_2)
| ~ member(VAR_0,VAR_1) ),
file('theBenchmark.p',intersection3) ).
cnf(c_120,plain,
( member(A,intersection(B,C))
| ~ member(A,C)
| ~ member(A,B) ),
inference(clausify,[status(thm)],[intersection3]) ).
fof(intersection1,axiom,
! [VAR_0,VAR_1,VAR_2] :
( member(VAR_0,VAR_1)
| ~ member(VAR_0,intersection(VAR_1,VAR_2)) ),
file('theBenchmark.p',intersection1) ).
cnf(c_122,plain,
( member(A,B)
| ~ member(A,intersection(B,C)) ),
inference(clausify,[status(thm)],[intersection1]) ).
fof(subclass_implies_equal,axiom,
! [VAR_0,VAR_1] :
( VAR_0 = VAR_1
| ~ subclass(VAR_1,VAR_0)
| ~ subclass(VAR_0,VAR_1) ),
file('theBenchmark.p',subclass_implies_equal) ).
cnf(c_138,plain,
( A = B
| ~ subclass(B,A)
| ~ subclass(A,B) ),
inference(clausify,[status(thm)],[subclass_implies_equal]) ).
fof(not_subclass_members2,axiom,
! [VAR_0,VAR_1] :
( subclass(VAR_0,VAR_1)
| ~ member(not_subclass_element(VAR_0,VAR_1),VAR_1) ),
file('theBenchmark.p',not_subclass_members2) ).
cnf(c_142,plain,
( subclass(A,B)
| ~ member(not_subclass_element(A,B),B) ),
inference(clausify,[status(thm)],[not_subclass_members2]) ).
fof(not_subclass_members1,axiom,
! [VAR_0,VAR_1] :
( subclass(VAR_0,VAR_1)
| member(not_subclass_element(VAR_0,VAR_1),VAR_0) ),
file('theBenchmark.p',not_subclass_members1) ).
cnf(c_143,plain,
( subclass(A,B)
| member(not_subclass_element(A,B),A) ),
inference(clausify,[status(thm)],[not_subclass_members1]) ).
cnf(c_176,plain,
( member(A,intersection(B,B))
| ~ member(A,B) ),
inference(factor,[status(thm)],[c_120]) ).
cnf(c_335,plain,
( member(not_subclass_element(intersection(A,B),C),A)
| subclass(intersection(A,B),C) ),
inference(resolve,[status(thm)],[c_143,c_122]) ).
cnf(c_391,plain,
( subclass(A,B)
| member(not_subclass_element(A,B),intersection(A,A)) ),
inference(resolve,[status(thm)],[c_176,c_143]) ).
cnf(c_7369,plain,
( subclass(A,intersection(A,A))
| subclass(A,intersection(A,A)) ),
inference(resolve,[status(thm)],[c_391,c_142]) ).
cnf(c_4205,plain,
subclass(A,intersection(A,A)),
inference(copy,[status(thm)],[c_7369]) ).
cnf(c_4240,plain,
( intersection(A,A) = A
| ~ subclass(intersection(A,A),A) ),
inference(resolve,[status(thm)],[c_4205,c_138]) ).
cnf(c_7370,plain,
( subclass(intersection(A,B),A)
| subclass(intersection(A,B),A) ),
inference(resolve,[status(thm)],[c_335,c_142]) ).
cnf(c_7353,plain,
subclass(intersection(A,B),A),
inference(copy,[status(thm)],[c_7370]) ).
cnf(c_7367,plain,
intersection(A,A) = A,
inference(resolve,[status(thm)],[c_7353,c_4240]) ).
cnf(c_7368,plain,
$false,
inference(resolve,[status(thm)],[c_7367,c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET148-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n006.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 26 07:13:25 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 647997 was started by sandbox2 on n006,
% 0.08/0.35 % Sat Sep 26 07:13:25 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 11.11/2.01
% 11.11/2.01 % given #500 (T,wt=19): 5445 member(regular(element_relation),element_relation) | member(ordered_pair(null_class,omega),A). [resolve(4900,b,3706,a)].
% 11.11/2.01
% 11.11/2.01 % SZS status Unsatisfiable for theBenchmark
% 11.11/2.01
% 11.11/2.01 % Proof 1 at 1.23 (+ 0.31) seconds.
% 11.11/2.01 % Length of proof is 14.
% 11.11/2.01 % Level of proof is 6.
% 11.11/2.01 % Maximum clause weight is 27.000.
% 11.11/2.01 % Given clauses 552.
% 11.11/2.01
% 11.11/2.01 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------