%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GEO344+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 : n028.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:21 PM UTC 2026
% Result : Theorem 1.94s 1.91s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 15 unt; 0 def)
% Number of atoms : 119 ( 44 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 144 ( 52 ~; 44 |; 45 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 36 ( 0 sgn 14 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))',axiom,
! [X16,X17,X18,X19] :
( ( ron(X17,X19)
& ron(X17,X18)
& ron(X16,X19)
& ron(X16,X18)
& ? [X20] :
( X19 = X20
& rline(X20) )
& ? [X21] :
( X18 = X21
& rline(X21) )
& X16 != X17
& ? [X22] :
( X17 = X22
& rpoint(X22) )
& ? [X23] :
( X16 = X23
& rpoint(X23) ) )
=> X18 = X19 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))') ).
fof('qu(theu(the(409), 1), imp(the(409)))',conjecture,
! [X1] :
( ( ron(vd1409,X1)
& ron(vd1401,X1)
& rline(X1) )
=> X1 = vd1419 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(theu(the(409), 1), imp(the(409)))') ).
fof('and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))',axiom,
( vd1406 = vd1407
& ron(vd1400,vd1406)
& ron(vd1399,vd1406)
& rline(vd1407)
& vd1400 != vd1401
& vd1399 != vd1401
& vd1399 != vd1400
& ? [X2] :
( vd1401 = X2
& rpoint(X2) )
& ? [X3] :
( vd1400 = X3
& rpoint(X3) )
& ? [X4] :
( vd1399 = X4
& rpoint(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))') ).
fof('and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))',axiom,
( ron(vd1409,vd1419)
& ron(vd1401,vd1419)
& rline(vd1419) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))') ).
fof('pred(406, 0)',axiom,
rpoint(vd1409),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(406, 0)') ).
fof('holds(conjunct2(conjunct2(conjunct2(406))), 1413, 0)',axiom,
vd1409 != vd1401,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct2(conjunct2(conjunct2(406))), 1413, 0)') ).
fof(c_0_6,plain,
! [X1638,X1639,X1640,X1641,X1642,X1643,X1644,X1645] :
( ~ ron(X1639,X1641)
| ~ ron(X1639,X1640)
| ~ ron(X1638,X1641)
| ~ ron(X1638,X1640)
| X1641 != X1642
| ~ rline(X1642)
| X1640 != X1643
| ~ rline(X1643)
| X1638 = X1639
| X1639 != X1644
| ~ rpoint(X1644)
| X1638 != X1645
| ~ rpoint(X1645)
| X1640 = X1641 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))'])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ron(vd1409,X1)
& ron(vd1401,X1)
& rline(X1) )
=> X1 = vd1419 ),
inference(assume_negation,[status(cth)],['qu(theu(the(409), 1), imp(the(409)))']) ).
fof(c_0_8,plain,
( vd1406 = vd1407
& ron(vd1400,vd1406)
& ron(vd1399,vd1406)
& rline(vd1407)
& vd1400 != vd1401
& vd1399 != vd1401
& vd1399 != vd1400
& vd1401 = esk2_0
& rpoint(esk2_0)
& vd1400 = esk3_0
& rpoint(esk3_0)
& vd1399 = esk4_0
& rpoint(esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))'])]) ).
cnf(c_0_9,plain,
( X4 = X1
| X3 = X2
| ~ ron(X1,X2)
| ~ ron(X1,X3)
| ~ ron(X4,X2)
| ~ ron(X4,X3)
| X2 != X5
| ~ rline(X5)
| X3 != X6
| ~ rline(X6)
| X1 != X7
| ~ rpoint(X7)
| X4 != X8
| ~ rpoint(X8) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
( ron(vd1409,esk1_0)
& ron(vd1401,esk1_0)
& rline(esk1_0)
& esk1_0 != vd1419 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
vd1401 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X1 = X2
| X3 = X4
| ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rline(X2)
| ~ rline(X1)
| ~ ron(X4,X2)
| ~ ron(X4,X1)
| ~ ron(X3,X2)
| ~ ron(X3,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,negated_conjecture,
ron(vd1401,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
rline(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( X1 = esk1_0
| X2 = vd1401
| ~ rpoint(X2)
| ~ rline(X1)
| ~ ron(vd1401,X1)
| ~ ron(X2,esk1_0)
| ~ ron(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_18,plain,
ron(vd1401,vd1419),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))']) ).
cnf(c_0_19,plain,
rline(vd1419),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))']) ).
cnf(c_0_20,negated_conjecture,
esk1_0 != vd1419,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( X1 = vd1401
| ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1419) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
ron(vd1409,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
rpoint(vd1409),
inference(split_conjunct,[status(thm)],['pred(406, 0)']) ).
cnf(c_0_24,plain,
ron(vd1409,vd1419),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(409))), 0), and(pred(s1(plural(the(409))), 0), pred(the(409), 0)))']) ).
cnf(c_0_25,plain,
vd1409 != vd1401,
inference(split_conjunct,[status(thm)],['holds(conjunct2(conjunct2(conjunct2(406))), 1413, 0)']) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO344+1 : TPTP v9.2.1. Released v4.1.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 : n028.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 : Mon May 4 18:02:15 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.94/1.91 % Version : CSE_E---1.7
% 1.94/1.91 % Problem : theBenchmark.p
% 1.94/1.91 % SZS status Theorem for theBenchmark.p
% 1.94/1.91 % SZS output start CNFRefutation
% See solution above
% 1.94/1.91 % Total time : 1.426s
%------------------------------------------------------------------------------