%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GEO274+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 : n018.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:13 PM UTC 2026
% Result : Theorem 1.78s 1.89s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 48 ( 26 unt; 0 def)
% Number of atoms : 162 ( 73 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 197 ( 83 ~; 78 |; 30 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 26 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))',axiom,
! [X369,X370,X371,X372] :
( ( ron(X370,X372)
& ron(X370,X371)
& ron(X369,X372)
& ron(X369,X371)
& ? [X373] :
( X372 = X373
& rline(X373) )
& ? [X374] :
( X371 = X374
& rline(X374) )
& X369 != X370
& ? [X375] :
( X370 = X375
& rpoint(X375) )
& ? [X376] :
( X369 = X376
& rpoint(X376) ) )
=> X371 = X372 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))') ).
fof('qu(theu(the(227), 1), imp(the(227)))',conjecture,
! [X1] :
( ( ron(vd1089,X1)
& ron(vd1080,X1)
& rline(X1) )
=> X1 = vd1092 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(theu(the(227), 1), imp(the(227)))') ).
fof('qe(s1(plural(224)))',axiom,
? [X2] :
( vd1080 = X2
& rpoint(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(s1(plural(224)))') ).
fof('qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))',axiom,
! [X7,X8] :
( ( ? [X9] :
( X8 = X9
& rpoint(X9) )
& ? [X10] :
( X7 = X10
& rpoint(X10) ) )
=> ( vf(X7,X8) = v0
<=> X7 = X8 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))') ).
fof('pred(225, 1)',axiom,
rpoint(vd1086),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(225, 1)') ).
fof('pred(225, 4)',axiom,
vd1085 = vd1086,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(225, 4)') ).
fof('qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))',axiom,
! [X3,X4] :
( ( ? [X5] :
( X4 = X5
& rpoint(X5) )
& ? [X6] :
( X3 = X6
& rpoint(X6) ) )
=> vf(X3,X4) = vf(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))') ).
fof('holds(226, 1090, 1)',axiom,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(226, 1090, 1)') ).
fof('holds(conjunct1(225), 1087, 0)',axiom,
vd1085 != vd1080,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct1(225), 1087, 0)') ).
fof('and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))',axiom,
( ron(vd1089,vd1092)
& ron(vd1080,vd1092)
& rline(vd1092) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))') ).
fof('pred(226, 0)',axiom,
rpoint(vd1089),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(226, 0)') ).
fof(c_0_11,plain,
! [X1851,X1852,X1853,X1854,X1855,X1856,X1857,X1858] :
( ~ ron(X1852,X1854)
| ~ ron(X1852,X1853)
| ~ ron(X1851,X1854)
| ~ ron(X1851,X1853)
| X1854 != X1855
| ~ rline(X1855)
| X1853 != X1856
| ~ rline(X1856)
| X1851 = X1852
| X1852 != X1857
| ~ rpoint(X1857)
| X1851 != X1858
| ~ rpoint(X1858)
| X1853 = X1854 ),
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_12,negated_conjecture,
~ ! [X1] :
( ( ron(vd1089,X1)
& ron(vd1080,X1)
& rline(X1) )
=> X1 = vd1092 ),
inference(assume_negation,[status(cth)],['qu(theu(the(227), 1), imp(the(227)))']) ).
fof(c_0_13,plain,
( vd1080 = esk2_0
& rpoint(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(224)))'])]) ).
fof(c_0_14,plain,
! [X1481,X1482,X1483,X1484] :
( ( vf(X1481,X1482) != v0
| X1481 = X1482
| X1482 != X1483
| ~ rpoint(X1483)
| X1481 != X1484
| ~ rpoint(X1484) )
& ( X1481 != X1482
| vf(X1481,X1482) = v0
| X1482 != X1483
| ~ rpoint(X1483)
| X1481 != X1484
| ~ rpoint(X1484) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))'])])])]) ).
cnf(c_0_15,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_11]) ).
fof(c_0_16,negated_conjecture,
( ron(vd1089,esk1_0)
& ron(vd1080,esk1_0)
& rline(esk1_0)
& esk1_0 != vd1092 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_17,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
vd1080 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( X1 = X2
| vf(X1,X2) != v0
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
rpoint(vd1086),
inference(split_conjunct,[status(thm)],['pred(225, 1)']) ).
cnf(c_0_21,plain,
vd1085 = vd1086,
inference(split_conjunct,[status(thm)],['pred(225, 4)']) ).
fof(c_0_22,plain,
! [X1477,X1478,X1479,X1480] :
( X1478 != X1479
| ~ rpoint(X1479)
| X1477 != X1480
| ~ rpoint(X1480)
| vf(X1477,X1478) = vf(X1478,X1477) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))'])])]) ).
cnf(c_0_23,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_15])])])]) ).
cnf(c_0_24,negated_conjecture,
ron(vd1080,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
rpoint(vd1080),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
rline(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( X1 = X2
| vf(X1,X2) != v0
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])]) ).
cnf(c_0_28,plain,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
inference(split_conjunct,[status(thm)],['holds(226, 1090, 1)']) ).
cnf(c_0_29,plain,
rpoint(vd1085),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
vd1085 != vd1080,
inference(split_conjunct,[status(thm)],['holds(conjunct1(225), 1087, 0)']) ).
cnf(c_0_31,plain,
( vf(X3,X1) = vf(X1,X3)
| X1 != X2
| ~ rpoint(X2)
| X3 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
( X1 = esk1_0
| X2 = vd1080
| ~ rpoint(X2)
| ~ rline(X1)
| ~ ron(vd1080,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_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_33,plain,
ron(vd1080,vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_34,plain,
rline(vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_35,negated_conjecture,
esk1_0 != vd1092,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,plain,
vf(vd1089,vd1080) != v0,
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_25])]),c_0_30]) ).
cnf(c_0_37,plain,
( vf(X1,X2) = vf(X2,X1)
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])]) ).
cnf(c_0_38,plain,
rpoint(vd1089),
inference(split_conjunct,[status(thm)],['pred(226, 0)']) ).
cnf(c_0_39,negated_conjecture,
( X1 = vd1080
| ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1092) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
ron(vd1089,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_41,plain,
ron(vd1089,vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_42,plain,
vf(vd1080,vd1089) != v0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_25]),c_0_38])]) ).
cnf(c_0_43,negated_conjecture,
vd1089 = vd1080,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_38]),c_0_41])]) ).
cnf(c_0_44,plain,
( vf(X1,X2) = v0
| X1 != X2
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,plain,
vf(vd1080,vd1080) != v0,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( vf(X1,X1) = v0
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])])]) ).
cnf(c_0_47,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO274+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 : n018.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:32 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.78/1.89 % Version : CSE_E---1.7
% 1.78/1.89 % Problem : theBenchmark.p
% 1.78/1.89 % SZS status Theorem for theBenchmark.p
% 1.78/1.89 % SZS output start CNFRefutation
% See solution above
% 1.78/1.89 % Total time : 1.421s
%------------------------------------------------------------------------------