%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET006-1 : 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 : n010.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:15 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subsets_axiom2,axiom,
! [VAR_0,VAR_1] :
( subset(VAR_0,VAR_1)
| ~ member(member_of_1_not_of_2(VAR_0,VAR_1),VAR_1) ),
file('theBenchmark.p',subsets_axiom2) ).
cnf(c_4,plain,
( subset(A,B)
| ~ member(member_of_1_not_of_2(A,B),B) ),
inference(clausify,[status(thm)],[subsets_axiom2]) ).
fof(prove_d_is_a_subset_of_a,axiom,
~ subset(d,a),
file('theBenchmark.p',prove_d_is_a_subset_of_a) ).
cnf(c_5,plain,
~ subset(d,a),
inference(clausify,[status(thm)],[prove_d_is_a_subset_of_a]) ).
fof(subsets_axiom1,axiom,
! [VAR_0,VAR_1] :
( member(member_of_1_not_of_2(VAR_0,VAR_1),VAR_0)
| subset(VAR_0,VAR_1) ),
file('theBenchmark.p',subsets_axiom1) ).
cnf(c_6,plain,
( member(member_of_1_not_of_2(A,B),A)
| subset(A,B) ),
inference(clausify,[status(thm)],[subsets_axiom1]) ).
fof(member_of_intersection_is_member_of_set2,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( member(VAR_3,VAR_1)
| ~ member(VAR_3,VAR_2)
| ~ intersection(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',member_of_intersection_is_member_of_set2) ).
cnf(c_10,plain,
( member(D,B)
| ~ member(D,C)
| ~ intersection(A,B,C) ),
inference(clausify,[status(thm)],[member_of_intersection_is_member_of_set2]) ).
fof(d_intersection_a_is_d,axiom,
intersection(d,a,d),
file('theBenchmark.p',d_intersection_a_is_d) ).
cnf(c_14,plain,
intersection(d,a,d),
inference(clausify,[status(thm)],[d_intersection_a_is_d]) ).
cnf(c_15,plain,
( member(A,a)
| ~ member(A,d) ),
inference(resolve,[status(thm)],[c_14,c_10]) ).
cnf(c_25,plain,
~ member(member_of_1_not_of_2(d,a),a),
inference(resolve,[status(thm)],[c_4,c_5]) ).
cnf(c_26,plain,
member(member_of_1_not_of_2(d,a),d),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_37,plain,
~ member(member_of_1_not_of_2(d,a),d),
inference(resolve,[status(thm)],[c_15,c_25]) ).
cnf(c_36,plain,
$false,
inference(resolve,[status(thm)],[c_26,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET006-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n010.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 06:48:30 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 2717210 was started by sandbox on n010,
% 0.09/0.37 % Sat Sep 26 06:48:30 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.37
% 0.14/0.37 % From the command line: assign(max_seconds, 300).
% 0.14/0.38
% 0.14/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.38
% 0.14/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/0.38 % Length of proof is 9.
% 0.14/0.38 % Level of proof is 2.
% 0.14/0.38 % Maximum clause weight is 6.000.
% 0.14/0.38 % Given clauses 11.
% 0.14/0.38
% 0.14/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------