%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC276+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 : n019.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:00 PM UTC 2026
% Result : Theorem 1.32s 1.73s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 60 ( 25 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 63 ( 18 ~; 20 |; 14 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| totalorderedP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(ax66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| totalorderedP(X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ~ totalorderedP(esk48_0)
& ( nil = esk51_0
| ssItem(esk52_0) )
& ( nil = esk50_0
| ssItem(esk52_0) )
& ( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk52_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk52_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk52_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_5,plain,
! [X407] :
( ~ ssItem(X407)
| totalorderedP(cons(X407,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
cnf(c_0_6,negated_conjecture,
~ totalorderedP(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( nil = esk50_0
| cons(esk52_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
~ totalorderedP(esk50_0),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( nil = esk50_0
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_13,plain,
totalorderedP(nil),
inference(split_conjunct,[status(thm)],[ax66]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC276+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.15/0.33 % Computer : n019.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:41:14 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.32/1.73 % Version : CSE_E---1.7
% 1.32/1.73 % Problem : theBenchmark.p
% 1.32/1.73 % SZS status Theorem for theBenchmark.p
% 1.32/1.73 % SZS output start CNFRefutation
% See solution above
% 1.32/1.73 % Total time : 1.371s
%------------------------------------------------------------------------------