%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GEO340+1 : TPTP v9.2.1. Released v4.1.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 : n024.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 04:20:20 PM UTC 2026
% Result : Theorem 1.43s 1.67s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 23 unt; 0 def)
% Number of atoms : 152 ( 83 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 190 ( 72 ~; 63 |; 52 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-7 aty)
% Number of variables : 46 ( 1 sgn 19 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(proof(404), 0), 0)',axiom,
! [X5,X6,X7,X8,X9] :
( ( X8 = X9
& ron(X6,X8)
& ron(X5,X8)
& rline(X9)
& X6 != X7
& X5 != X7
& X5 != X6
& ? [X10] :
( X7 = X10
& rpoint(X10) )
& ? [X11] :
( X6 = X11
& rpoint(X11) )
& ? [X12] :
( X5 = X12
& rpoint(X12) ) )
=> ! [X13] :
( ( X13 != X7
& vf(X6,X7) = vf(X6,X13)
& vf(X5,X7) = vf(X5,X13)
& rS(X7,X13,X8)
& rpoint(X13) )
=> ! [X14] :
( X14 = vskolem1416(X13,X5,X6,X7,X8,X9)
=> ! [X15] : X15 != vskolem1419(X14,X13,X5,X6,X7,X8,X9) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(404), 0), 0)') ).
fof('neg(neg(403))',conjecture,
~ ? [X1] :
( X1 != vd1386
& vf(vd1385,vd1386) = vf(vd1385,X1)
& vf(vd1384,vd1386) = vf(vd1384,X1)
& rS(vd1386,X1,vd1391)
& rpoint(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','neg(neg(403))') ).
fof('and(pred(conjunct2(402), 5), and(pred(s2(plural(conjunct2(402))), 0), and(pred(s1(plural(conjunct2(402))), 0), and(pred(conjunct2(402), 1), and(pred(conjunct1(402), 9), and(pred(conjunct1(402), 8), and(pred(conjunct1(402), 7), and(qe(s3(plural(402))), and(qe(s2(plural(402))), qe(s1(plural(402))))))))))))',axiom,
( vd1391 = vd1392
& ron(vd1385,vd1391)
& ron(vd1384,vd1391)
& rline(vd1392)
& vd1385 != vd1386
& vd1384 != vd1386
& vd1384 != vd1385
& ? [X2] :
( vd1386 = X2
& rpoint(X2) )
& ? [X3] :
( vd1385 = X3
& rpoint(X3) )
& ? [X4] :
( vd1384 = X4
& rpoint(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(conjunct2(402), 5), and(pred(s2(plural(conjunct2(402))), 0), and(pred(s1(plural(conjunct2(402))), 0), and(pred(conjunct2(402), 1), and(pred(conjunct1(402), 9), and(pred(conjunct1(402), 8), and(pred(conjunct1(402), 7), and(qe(s3(plural(402))), and(qe(s2(plural(402))), qe(s1(plural(402))))))))))))') ).
fof(c_0_3,plain,
! [X1697,X1698,X1699,X1700,X1701,X1702,X1703,X1704,X1705,X1706,X1707] :
( X1700 != X1701
| ~ ron(X1698,X1700)
| ~ ron(X1697,X1700)
| ~ rline(X1701)
| X1698 = X1699
| X1697 = X1699
| X1697 = X1698
| X1699 != X1702
| ~ rpoint(X1702)
| X1698 != X1703
| ~ rpoint(X1703)
| X1697 != X1704
| ~ rpoint(X1704)
| X1705 = X1699
| vf(X1698,X1699) != vf(X1698,X1705)
| vf(X1697,X1699) != vf(X1697,X1705)
| ~ rS(X1699,X1705,X1700)
| ~ rpoint(X1705)
| X1706 != vskolem1416(X1705,X1697,X1698,X1699,X1700,X1701)
| X1707 != vskolem1419(X1706,X1705,X1697,X1698,X1699,X1700,X1701) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(proof(404), 0), 0)'])])]) ).
fof(c_0_4,negated_conjecture,
~ ~ ? [X1] :
( X1 != vd1386
& vf(vd1385,vd1386) = vf(vd1385,X1)
& vf(vd1384,vd1386) = vf(vd1384,X1)
& rS(vd1386,X1,vd1391)
& rpoint(X1) ),
inference(assume_negation,[status(cth)],['neg(neg(403))']) ).
fof(c_0_5,plain,
( vd1391 = vd1392
& ron(vd1385,vd1391)
& ron(vd1384,vd1391)
& rline(vd1392)
& vd1385 != vd1386
& vd1384 != vd1386
& vd1384 != vd1385
& vd1386 = esk2_0
& rpoint(esk2_0)
& vd1385 = esk3_0
& rpoint(esk3_0)
& vd1384 = esk4_0
& rpoint(esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['and(pred(conjunct2(402), 5), and(pred(s2(plural(conjunct2(402))), 0), and(pred(s1(plural(conjunct2(402))), 0), and(pred(conjunct2(402), 1), and(pred(conjunct1(402), 9), and(pred(conjunct1(402), 8), and(pred(conjunct1(402), 7), and(qe(s3(plural(402))), and(qe(s2(plural(402))), qe(s1(plural(402))))))))))))'])]) ).
cnf(c_0_6,plain,
( X3 = X5
| X4 = X5
| X4 = X3
| X9 = X5
| X1 != X2
| ~ ron(X3,X1)
| ~ ron(X4,X1)
| ~ rline(X2)
| X5 != X6
| ~ rpoint(X6)
| X3 != X7
| ~ rpoint(X7)
| X4 != X8
| ~ rpoint(X8)
| vf(X3,X5) != vf(X3,X9)
| vf(X4,X5) != vf(X4,X9)
| ~ rS(X5,X9,X1)
| ~ rpoint(X9)
| X10 != vskolem1416(X9,X4,X3,X5,X1,X2)
| X11 != vskolem1419(X10,X9,X4,X3,X5,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,negated_conjecture,
( esk1_0 != vd1386
& vf(vd1385,vd1386) = vf(vd1385,esk1_0)
& vf(vd1384,vd1386) = vf(vd1384,esk1_0)
& rS(vd1386,esk1_0,vd1391)
& rpoint(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
rline(vd1392),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
vd1391 = vd1392,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
vd1386 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( X1 = X2
| X3 = X1
| X4 = X1
| X4 = X3
| vf(X3,X1) != vf(X3,X2)
| vf(X4,X1) != vf(X4,X2)
| ~ rline(X5)
| ~ ron(X3,X5)
| ~ ron(X4,X5)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rpoint(X4)
| ~ rpoint(X1)
| ~ rS(X1,X2,X5) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])])])])])]) ).
cnf(c_0_13,negated_conjecture,
rS(vd1386,esk1_0,vd1391),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
rline(vd1391),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
rpoint(vd1386),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 != vd1386,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
vd1384 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( X1 = vd1386
| X2 = vd1386
| X2 = X1
| vf(X1,esk1_0) != vf(X1,vd1386)
| vf(X2,esk1_0) != vf(X2,vd1386)
| ~ ron(X1,vd1391)
| ~ ron(X2,vd1391)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_21,plain,
ron(vd1384,vd1391),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
vf(vd1384,vd1386) = vf(vd1384,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,plain,
rpoint(vd1384),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
vd1384 != vd1386,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
vd1385 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_27,negated_conjecture,
( X1 = vd1384
| X1 = vd1386
| vf(X1,esk1_0) != vf(X1,vd1386)
| ~ ron(X1,vd1391)
| ~ rpoint(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
vf(vd1385,vd1386) = vf(vd1385,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,plain,
ron(vd1385,vd1391),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_30,plain,
rpoint(vd1385),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
vd1384 != vd1385,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_32,plain,
vd1385 != vd1386,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]),c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : GEO340+1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.06 % 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.05/0.24 % Computer : n024.cluster.edu
% 0.05/0.24 % Model : x86_64 x86_64
% 0.05/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.24 % Memory : 8042.1875MB
% 0.05/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.05/0.24 % CPULimit : 300
% 0.05/0.24 % WCLimit : 300
% 0.05/0.24 % DateTime : Mon May 4 12:53:26 EDT 2026
% 0.05/0.24 % CPUTime :
% 0.05/0.24 % start to proof: theBenchmark
% 1.43/1.67 % Version : CSE_E---1.7
% 1.43/1.67 % Problem : theBenchmark.p
% 1.43/1.67 % SZS status Theorem for theBenchmark.p
% 1.43/1.67 % SZS output start CNFRefutation
% See solution above
% 1.43/1.68 % Total time : 1.363s
%------------------------------------------------------------------------------