%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU306+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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:45 AM UTC 2026
% Result : Theorem 0.09s 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 17 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 1 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 5 ( 0 sgn 3 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_pre_topc,axiom,
! [A] :
( one_sorted_str(A)
=> cast_as_carrier_subset(A) = the_carrier(A) ),
file('theBenchmark.p',d3_pre_topc) ).
fof(t12_pre_topc,conjecture,
! [A] :
( one_sorted_str(A)
=> cast_as_carrier_subset(A) = the_carrier(A) ),
file('theBenchmark.p',t12_pre_topc) ).
fof(t12_pre_topc_neg,negated_conjecture,
~ ! [A] :
( one_sorted_str(A)
=> cast_as_carrier_subset(A) = the_carrier(A) ),
inference(assume_negation,[status(cth)],[t12_pre_topc]) ).
cnf(c_46,plain,
( the_carrier(A) = cast_as_carrier_subset(A)
| ~ one_sorted_str(A) ),
inference(clausify,[status(thm)],[d3_pre_topc]) ).
fof(nnf_40,plain,
? [A] :
( the_carrier(A) != cast_as_carrier_subset(A)
& one_sorted_str(A) ),
inference(fof_nnf,[status(thm)],[t12_pre_topc_neg]) ).
fof(sk_t12_pre_topc_neg,plain,
( the_carrier(sK0) != cast_as_carrier_subset(sK0)
& one_sorted_str(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(A,sK0)],[nnf_40]) ).
cnf(c_47,negated_conjecture,
one_sorted_str(sK0),
inference(split_conjunct,[status(thm)],[sk_t12_pre_topc_neg]) ).
cnf(c_49,negated_conjecture,
the_carrier(sK0) = cast_as_carrier_subset(sK0),
inference(resolve,[status(thm)],[c_47,c_46]) ).
cnf(c_53,negated_conjecture,
the_carrier(sK0) != cast_as_carrier_subset(sK0),
inference(split_conjunct,[status(thm)],[sk_t12_pre_topc_neg]) ).
cnf(c_55,negated_conjecture,
cast_as_carrier_subset(sK0) != cast_as_carrier_subset(sK0),
inference(paramod,[status(thm)],[c_49,c_53]) ).
cnf(c_54,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU306+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n011.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 09:09:14 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 143169 was started by sandbox2 on n011,
% 0.09/0.36 % Sat Sep 26 09:09:14 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.09/0.39
% 0.09/0.39 % SZS status Theorem for theBenchmark
% 0.09/0.39
% 0.09/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.39 % Length of proof is 7.
% 0.09/0.39 % Level of proof is 3.
% 0.09/0.39 % Maximum clause weight is 5.000.
% 0.09/0.39 % Given clauses 0.
% 0.09/0.39
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------