%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC333+1 : TPTP v9.2.1. Released v2.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 : n009.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:13 PM UTC 2026
% Result : Theorem 1.30s 1.75s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 105 ( 8 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 135 ( 52 ~; 48 |; 25 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/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
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X464] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& segmentP(esk51_0,esk50_0)
& totalorderedP(esk50_0)
& ( ~ ssList(X464)
| ~ neq(esk50_0,X464)
| ~ segmentP(esk51_0,X464)
| ~ segmentP(X464,esk50_0)
| ~ totalorderedP(X464) )
& ( ssList(esk52_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) )
& ( neq(esk48_0,esk52_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) )
& ( segmentP(esk49_0,esk52_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) )
& ( segmentP(esk52_0,esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) )
& ( totalorderedP(esk52_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_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,
totalorderedP(esk50_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,
segmentP(esk51_0,esk50_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,
( ~ ssList(X1)
| ~ neq(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ segmentP(X1,esk50_0)
| ~ totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( segmentP(esk52_0,esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
totalorderedP(esk48_0),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_10,negated_conjecture,
segmentP(esk49_0,esk48_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( totalorderedP(esk52_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( segmentP(esk49_0,esk52_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( ssList(esk52_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( neq(esk48_0,esk52_0)
| ~ segmentP(esk49_0,esk48_0)
| ~ totalorderedP(esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk48_0)
| ~ segmentP(esk49_0,X1)
| ~ ssList(X1)
| ~ neq(esk48_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_4]),c_0_4]),c_0_6]) ).
cnf(c_0_16,negated_conjecture,
segmentP(esk52_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_17,negated_conjecture,
totalorderedP(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_10])]) ).
cnf(c_0_18,negated_conjecture,
segmentP(esk49_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_9]),c_0_10])]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9]),c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
neq(esk48_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_9]),c_0_10])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC333+1 : TPTP v9.2.1. Released v2.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.14/0.32 % Computer : n009.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 04:44:56 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.30/1.75 % Version : CSE_E---1.7
% 1.30/1.75 % Problem : theBenchmark.p
% 1.30/1.75 % SZS status Theorem for theBenchmark.p
% 1.30/1.75 % SZS output start CNFRefutation
% See solution above
% 1.30/1.75 % Total time : 1.401s
%------------------------------------------------------------------------------