%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC406+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n023.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:19:32 PM UTC 2026
% Result : Theorem 1.30s 1.73s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 8 unt; 0 def)
% Number of atoms : 89 ( 14 equ)
% Maximal formula atoms : 34 ( 7 avg)
% Number of connectives : 115 ( 38 ~; 37 |; 28 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 19 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X4,X6)
| ~ leq(X6,X5)
| X5 = X6 ) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) ) ) )
| ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X1,X7)
| memberP(X2,X7) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X4,X6)
| ~ leq(X6,X5)
| X5 = X6 ) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) ) ) )
| ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X1,X7)
| memberP(X2,X7) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X467,X469] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( ssItem(esk52_1(X467))
| memberP(esk50_0,X467)
| ~ memberP(esk51_0,X467)
| ~ ssItem(X467) )
& ( memberP(esk51_0,esk52_1(X467))
| memberP(esk50_0,X467)
| ~ memberP(esk51_0,X467)
| ~ ssItem(X467) )
& ( leq(esk52_1(X467),X467)
| memberP(esk50_0,X467)
| ~ memberP(esk51_0,X467)
| ~ ssItem(X467) )
& ( X467 != esk52_1(X467)
| memberP(esk50_0,X467)
| ~ memberP(esk51_0,X467)
| ~ ssItem(X467) )
& ( memberP(esk51_0,X467)
| ~ memberP(esk50_0,X467)
| ~ ssItem(X467) )
& ( ~ ssItem(X469)
| X467 = X469
| ~ memberP(esk51_0,X469)
| ~ leq(X469,X467)
| ~ memberP(esk50_0,X467)
| ~ ssItem(X467) )
& ssItem(esk53_0)
& memberP(esk48_0,esk53_0)
& ~ memberP(esk49_0,esk53_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
memberP(esk48_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ memberP(esk49_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( memberP(esk51_0,X1)
| ~ memberP(esk50_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
memberP(esk50_0,esk53_0),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_9,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
~ memberP(esk51_0,esk53_0),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC406+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n023.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 04:49:38 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.30/1.73 % Version : CSE_E---1.7
% 1.30/1.73 % Problem : theBenchmark.p
% 1.30/1.73 % SZS status Theorem for theBenchmark.p
% 1.30/1.73 % SZS output start CNFRefutation
% See solution above
% 1.30/1.73 % Total time : 1.372s
%------------------------------------------------------------------------------