%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU121+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 : 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:40 PM UTC 2026
% Result : Theorem 1.23s 1.71s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 35 ( 13 ~; 12 |; 6 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t1_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
inference(assume_negation,[status(cth)],[t1_xboole_1]) ).
fof(c_0_3,plain,
! [X23,X24,X25,X26,X27] :
( ( ~ subset(X23,X24)
| ~ in(X25,X23)
| in(X25,X24) )
& ( in(esk1_2(X26,X27),X26)
| subset(X26,X27) )
& ( ~ in(esk1_2(X26,X27),X27)
| subset(X26,X27) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
fof(c_0_4,negated_conjecture,
( subset(esk4_0,esk5_0)
& subset(esk5_0,esk6_0)
& ~ subset(esk4_0,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
subset(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( in(X1,esk6_0)
| ~ in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
subset(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( subset(X1,esk6_0)
| ~ in(esk1_2(X1,esk6_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( in(X1,esk5_0)
| ~ in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( subset(X1,esk6_0)
| ~ in(esk1_2(X1,esk6_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
~ subset(esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU121+1 : 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.16/0.32 % Computer : n031.cluster.edu
% 0.16/0.32 % Model : x86_64 x86_64
% 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32 % Memory : 8042.1875MB
% 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Tue May 5 02:45:53 EDT 2026
% 0.16/0.32 % CPUTime :
% 0.16/0.33 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Theorem for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------