%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU306+2 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:11:25 PM UTC 2026
% Result : Theorem 2.21s 2.01s
% Output : CNFRefutation 2.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 15 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t12_pre_topc,conjecture,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_pre_topc) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(assume_negation,[status(cth)],[t12_pre_topc]) ).
fof(c_0_3,plain,
! [X1555] :
( ~ one_sorted_str(X1555)
| cast_as_carrier_subset(X1555) = the_carrier(X1555) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).
fof(c_0_4,negated_conjecture,
( one_sorted_str(esk283_0)
& cast_as_carrier_subset(esk283_0) != the_carrier(esk283_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
one_sorted_str(esk283_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
cast_as_carrier_subset(esk283_0) != the_carrier(esk283_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU306+2 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.31 % Computer : n002.cluster.edu
% 0.14/0.31 % Model : x86_64 x86_64
% 0.14/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.31 % Memory : 8042.1875MB
% 0.14/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.31 % CPULimit : 300
% 0.14/0.31 % WCLimit : 300
% 0.14/0.31 % DateTime : Tue May 5 02:56:16 EDT 2026
% 0.14/0.31 % CPUTime :
% 0.14/0.32 % start to proof: theBenchmark
% 2.21/2.01 % Version : CSE_E---1.7
% 2.21/2.01 % Problem : theBenchmark.p
% 2.21/2.01 % SZS status Theorem for theBenchmark.p
% 2.21/2.01 % SZS output start CNFRefutation
% See solution above
% 2.21/2.01 % Total time : 1.533s
%------------------------------------------------------------------------------