%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU163+3 : TPTP v9.2.1. Released v3.2.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 : n031.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:10:53 PM UTC 2026
% Result : Theorem 0.26s 1.62s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 13 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 25 ( 15 ~; 4 |; 1 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 25 ( 1 sgn 17 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(t92_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t92_zfmisc_1) ).
fof(rc2_xboole_0,axiom,
? [X1] : ~ empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(l50_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(i_0_6,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(i_0_7,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
inference(assume_negation,[status(cth)],[t92_zfmisc_1]) ).
fof(i_0_8,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[rc2_xboole_0]) ).
fof(i_0_9,plain,
! [X14,X15] :
( ~ in(X14,X15)
| ~ in(X15,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_6])]) ).
fof(i_0_10,plain,
! [X20,X21] :
( ~ in(X20,X21)
| subset(X20,union(X21)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l50_zfmisc_1])]) ).
fof(i_0_11,negated_conjecture,
( in(esk3_0,esk4_0)
& ~ subset(esk3_0,union(esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_7])])]) ).
fof(i_0_12,plain,
! [X13] : subset(X13,X13),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(i_0_13,plain,
~ empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_8])]) ).
fof(i_0_14,plain,
empty(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(i_0_15,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_9]),
[final] ).
cnf(i_0_16,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_17,negated_conjecture,
~ subset(esk3_0,union(esk4_0)),
inference(split_conjunct,[status(thm)],[i_0_11]),
[final] ).
cnf(i_0_18,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_12]),
[final] ).
cnf(i_0_19,negated_conjecture,
in(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[i_0_11]),
[final] ).
cnf(i_0_20,plain,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_21,plain,
empty(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_22,plain,
$false,
inference(scs_inference,[],[i_0_17,i_0_19,i_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU163+3 : TPTP v9.2.1. Released v3.2.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.16/0.33 % Computer : n031.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 02:48:09 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.26/1.62 % Version : CSE_E---1.7
% 0.26/1.62 % Problem : theBenchmark.p
% 0.26/1.62 % SZS status Theorem for theBenchmark.p
% 0.26/1.62 % SZS output start CNFRefutation
% See solution above
% 0.26/1.63 % Total time : 1.270s
%------------------------------------------------------------------------------