%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GEO271+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 : n005.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:12 PM UTC 2026
% Result : Theorem 1.90s 1.90s
% Output : CNFRefutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 82 ( 25 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 104 ( 43 ~; 37 |; 21 &)
% ( 0 <=>; 3 =>; 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 : 34 ( 0 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))',axiom,
! [X136,X137,X138,X139,X140] :
( ( vf(X138,X136) = vf(X138,X137)
& ron(X137,X140)
& ron(X136,X139)
& rcenter(X138,X140)
& rcenter(X138,X139)
& ? [X141] :
( X137 = X141
& rpoint(X141) )
& ? [X142] :
( X136 = X142
& rpoint(X142) ) )
=> X139 = X140 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))') ).
fof('qu(theu(the(211), 1), imp(the(211)))',conjecture,
! [X1] :
( ( ron(vd1057,X1)
& rcenter(vd1055,X1)
& rcircle(X1) )
=> X1 = vd1061 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(theu(the(211), 1), imp(the(211)))') ).
fof('and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))',axiom,
( ron(vd1057,vd1061)
& rcenter(vd1055,vd1061)
& rcircle(vd1061) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))') ).
fof('and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))',axiom,
( vd1057 = vd1058
& vd1055 != vd1057
& rpoint(vd1058)
& vd1055 = vd1056
& rpoint(vd1056) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))') ).
fof(c_0_4,plain,
! [X1590,X1591,X1592,X1593,X1594,X1595,X1596] :
( vf(X1592,X1590) != vf(X1592,X1591)
| ~ ron(X1591,X1594)
| ~ ron(X1590,X1593)
| ~ rcenter(X1592,X1594)
| ~ rcenter(X1592,X1593)
| X1591 != X1595
| ~ rpoint(X1595)
| X1590 != X1596
| ~ rpoint(X1596)
| X1593 = X1594 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))'])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( ron(vd1057,X1)
& rcenter(vd1055,X1)
& rcircle(X1) )
=> X1 = vd1061 ),
inference(assume_negation,[status(cth)],['qu(theu(the(211), 1), imp(the(211)))']) ).
cnf(c_0_6,plain,
( X5 = X4
| vf(X1,X2) != vf(X1,X3)
| ~ ron(X3,X4)
| ~ ron(X2,X5)
| ~ rcenter(X1,X4)
| ~ rcenter(X1,X5)
| X3 != X6
| ~ rpoint(X6)
| X2 != X7
| ~ rpoint(X7) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
( ron(vd1057,esk1_0)
& rcenter(vd1055,esk1_0)
& rcircle(esk1_0)
& esk1_0 != vd1061 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
( X1 = X2
| vf(X3,X4) != vf(X3,X5)
| ~ rpoint(X4)
| ~ rpoint(X5)
| ~ rcenter(X3,X2)
| ~ rcenter(X3,X1)
| ~ ron(X5,X1)
| ~ ron(X4,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]) ).
cnf(c_0_9,negated_conjecture,
rcenter(vd1055,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( X1 = esk1_0
| vf(vd1055,X2) != vf(vd1055,X3)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rcenter(vd1055,X1)
| ~ ron(X2,esk1_0)
| ~ ron(X3,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
rcenter(vd1055,vd1061),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))']) ).
cnf(c_0_12,negated_conjecture,
esk1_0 != vd1061,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( vf(vd1055,X1) != vf(vd1055,X2)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ ron(X1,esk1_0)
| ~ ron(X2,vd1061) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,plain,
rpoint(vd1058),
inference(split_conjunct,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))']) ).
cnf(c_0_15,plain,
vd1057 = vd1058,
inference(split_conjunct,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))']) ).
cnf(c_0_16,negated_conjecture,
( ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1061) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
ron(vd1057,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
rpoint(vd1057),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
ron(vd1057,vd1061),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))']) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO271+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.15/0.33 % Computer : n005.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 : Mon May 4 17:51:30 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.90/1.90 % Version : CSE_E---1.7
% 1.90/1.90 % Problem : theBenchmark.p
% 1.90/1.90 % SZS status Theorem for theBenchmark.p
% 1.90/1.90 % SZS output start CNFRefutation
% See solution above
% 1.90/1.90 % Total time : 1.421s
%------------------------------------------------------------------------------