%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU307+1 : 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 : n005.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 1.31s 1.73s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 52 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 43 ( 18 ~; 13 |; 4 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 37 ( 1 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_pre_topc,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_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(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(t28_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(redefinition_k5_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> subset_intersection2(X1,X2,X3) = set_intersection2(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k5_subset_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1)) = X2 ) ),
inference(assume_negation,[status(cth)],[t15_pre_topc]) ).
fof(c_0_7,negated_conjecture,
( one_sorted_str(esk6_0)
& element(esk7_0,powerset(the_carrier(esk6_0)))
& subset_intersection2(the_carrier(esk6_0),esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X193] :
( ~ one_sorted_str(X193)
| cast_as_carrier_subset(X193) = the_carrier(X193) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).
fof(c_0_9,plain,
! [X191,X192] :
( ( ~ element(X191,powerset(X192))
| subset(X191,X192) )
& ( ~ subset(X191,X192)
| element(X191,powerset(X192)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_10,plain,
! [X179] : subset(X179,X179),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_11,plain,
! [X196,X197] :
( ~ subset(X196,X197)
| set_intersection2(X196,X197) = X196 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
cnf(c_0_12,negated_conjecture,
subset_intersection2(the_carrier(esk6_0),esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
one_sorted_str(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X183,X184,X185] :
( ~ element(X184,powerset(X183))
| ~ element(X185,powerset(X183))
| subset_intersection2(X183,X184,X185) = set_intersection2(X184,X185) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_subset_1])]) ).
cnf(c_0_16,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
subset_intersection2(the_carrier(esk6_0),esk7_0,the_carrier(esk6_0)) != esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_21,plain,
( subset_intersection2(X2,X1,X3) = set_intersection2(X1,X3)
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
element(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
element(esk7_0,powerset(the_carrier(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,plain,
( set_intersection2(X1,X2) = X1
| ~ element(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
set_intersection2(esk7_0,the_carrier(esk6_0)) != esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU307+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n005.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 02:56:00 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.31/1.73 % Version : CSE_E---1.7
% 1.31/1.73 % Problem : theBenchmark.p
% 1.31/1.73 % SZS status Theorem for theBenchmark.p
% 1.31/1.73 % SZS output start CNFRefutation
% See solution above
% 1.31/1.73 % Total time : 1.369s
%------------------------------------------------------------------------------