%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU167+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 : n021.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:54 PM UTC 2026
% Result : Theorem 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 15 ~; 12 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t118_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))
& subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t118_zfmisc_1) ).
fof(t119_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t119_zfmisc_1) ).
fof(c_0_3,plain,
! [X25,X26,X27] :
( ~ subset(X25,X26)
| ~ subset(X26,X27)
| subset(X25,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(c_0_4,plain,
! [X18,X19,X20] :
( ( subset(cartesian_product2(X18,X20),cartesian_product2(X19,X20))
| ~ subset(X18,X19) )
& ( subset(cartesian_product2(X20,X18),cartesian_product2(X20,X19))
| ~ subset(X18,X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t118_zfmisc_1])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
inference(assume_negation,[status(cth)],[t119_zfmisc_1]) ).
cnf(c_0_6,plain,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& subset(esk3_0,esk4_0)
& ~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ subset(X1,cartesian_product2(X4,X3))
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ subset(X1,X3)
| ~ subset(X2,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU167+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.14/0.33 % Computer : n021.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 02:46:55 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Theorem for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.369s
%------------------------------------------------------------------------------