%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU429+3 : TPTP v9.2.1. Released v3.4.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:12:18 PM UTC 2026
% Result : Theorem 17.71s 17.27s
% Output : CNFRefutation 17.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 5 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 34 ( 13 ~; 6 |; 7 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 24 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t28_relset_2,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_relset_2) ).
fof(s8_domain_1__e1_38__relset_2,axiom,
! [X1,X2,X3,X4] :
( ( ~ v1_xboole_0(X1)
& m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
& m2_relset_1(X4,X1,X2) )
=> m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s8_domain_1__e1_38__relset_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t28_relset_2])]) ).
fof(c_0_3,plain,
! [X1,X2,X3,X4] :
( ( ~ v1_xboole_0(X1)
& m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
& m2_relset_1(X4,X1,X2) )
=> m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
inference(fof_simplification,[status(thm)],[s8_domain_1__e1_38__relset_2]) ).
fof(c_0_4,negated_conjecture,
( ~ v1_xboole_0(esk1_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
& m2_relset_1(esk4_0,esk1_0,esk2_0)
& ~ m1_subset_1(a_4_1_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,plain,
! [X1526,X1527,X1528,X1529] :
( v1_xboole_0(X1526)
| ~ m1_subset_1(X1528,k1_zfmisc_1(k1_zfmisc_1(X1526)))
| ~ m2_relset_1(X1529,X1526,X1527)
| m1_subset_1(a_4_1_relset_2(X1526,X1527,X1528,X1529),k1_zfmisc_1(k1_zfmisc_1(X1527))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,negated_conjecture,
~ m1_subset_1(a_4_1_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( v1_xboole_0(X1)
| m1_subset_1(a_4_1_relset_2(X1,X4,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X4)))
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
| ~ m2_relset_1(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
m2_relset_1(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU429+3 : TPTP v9.2.1. Released v3.4.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.17/0.34 % Computer : n002.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue May 5 03:11:04 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.35 % start to proof: theBenchmark
% 17.71/17.27 % Version : CSE_E---1.7
% 17.71/17.27 % Problem : theBenchmark.p
% 17.71/17.27 % SZS status Theorem for theBenchmark.p
% 17.71/17.27 % SZS output start CNFRefutation
% See solution above
% 17.71/17.27 % Total time : 16.790s
%------------------------------------------------------------------------------