%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GEO331+1 : TPTP v9.2.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n002.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:19 PM UTC 2026
% Result : Theorem 1.56s 1.83s
% Output : CNFRefutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 21 unt; 0 def)
% Number of atoms : 137 ( 86 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 162 ( 61 ~; 62 |; 33 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn 21 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(proof(385), 0), 2)',axiom,
! [X4,X5,X6] :
( ( vangle(X4,X5,X6) = vangle(X4,X6,X5)
& X5 != X6
& X4 != X6
& X4 != X5
& ? [X7] :
( X6 = X7
& rpoint(X7) )
& ? [X8] :
( X5 = X8
& rpoint(X8) )
& ? [X9] :
( X4 = X9
& rpoint(X9) ) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ~ rless(vf(X4,X6),vf(X4,X5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(385), 0), 2)') ).
fof('ass(cond(proof(385), 0), 0)',axiom,
! [X4,X5,X6] :
( ( vangle(X4,X5,X6) = vangle(X4,X6,X5)
& X5 != X6
& X4 != X6
& X4 != X5
& ? [X7] :
( X6 = X7
& rpoint(X7) )
& ? [X8] :
( X5 = X8
& rpoint(X8) )
& ? [X9] :
( X4 = X9
& rpoint(X9) ) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ( rless(vf(X4,X5),vf(X4,X6))
| rless(vf(X4,X6),vf(X4,X5)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(385), 0), 0)') ).
fof('qe(s1(plural(383)))',axiom,
? [X3] :
( vd1352 = X3
& rpoint(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s1(plural(383)))') ).
fof('qe(s3(plural(383)))',axiom,
? [X1] :
( vd1354 = X1
& rpoint(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s3(plural(383)))') ).
fof('qe(s2(plural(383)))',axiom,
? [X2] :
( vd1353 = X2
& rpoint(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s2(plural(383)))') ).
fof('holds(384, 1360, 0)',conjecture,
vf(vd1352,vd1353) = vf(vd1352,vd1354),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(384, 1360, 0)') ).
fof('holds(383, 1356, 0)',axiom,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(383, 1356, 0)') ).
fof('pred(383, 8)',axiom,
vd1352 != vd1354,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 8)') ).
fof('pred(383, 7)',axiom,
vd1352 != vd1353,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 7)') ).
fof('pred(383, 9)',axiom,
vd1353 != vd1354,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(383, 9)') ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( ( vangle(X4,X5,X6) = vangle(X4,X6,X5)
& X5 != X6
& X4 != X6
& X4 != X5
& ? [X7] :
( X6 = X7
& rpoint(X7) )
& ? [X8] :
( X5 = X8
& rpoint(X8) )
& ? [X9] :
( X4 = X9
& rpoint(X9) ) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ~ rless(vf(X4,X6),vf(X4,X5)) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(385), 0), 2)']) ).
fof(c_0_11,plain,
! [X1646,X1647,X1648,X1649,X1650,X1651] :
( vangle(X1646,X1647,X1648) != vangle(X1646,X1648,X1647)
| X1647 = X1648
| X1646 = X1648
| X1646 = X1647
| X1648 != X1649
| ~ rpoint(X1649)
| X1647 != X1650
| ~ rpoint(X1650)
| X1646 != X1651
| ~ rpoint(X1651)
| vf(X1646,X1647) = vf(X1646,X1648)
| ~ rless(vf(X1646,X1648),vf(X1646,X1647)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_12,plain,
! [X1634,X1635,X1636,X1637,X1638,X1639] :
( vangle(X1634,X1635,X1636) != vangle(X1634,X1636,X1635)
| X1635 = X1636
| X1634 = X1636
| X1634 = X1635
| X1636 != X1637
| ~ rpoint(X1637)
| X1635 != X1638
| ~ rpoint(X1638)
| X1634 != X1639
| ~ rpoint(X1639)
| vf(X1634,X1635) = vf(X1634,X1636)
| rless(vf(X1634,X1635),vf(X1634,X1636))
| rless(vf(X1634,X1636),vf(X1634,X1635)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(proof(385), 0), 0)'])])]) ).
cnf(c_0_13,plain,
( X2 = X3
| X1 = X3
| X1 = X2
| vf(X1,X2) = vf(X1,X3)
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| X3 != X4
| ~ rpoint(X4)
| X2 != X5
| ~ rpoint(X5)
| X1 != X6
| ~ rpoint(X6)
| ~ rless(vf(X1,X3),vf(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
( vd1352 = esk3_0
& rpoint(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(383)))'])]) ).
fof(c_0_15,plain,
( vd1354 = esk1_0
& rpoint(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(383)))'])]) ).
fof(c_0_16,plain,
( vd1353 = esk2_0
& rpoint(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(383)))'])]) ).
cnf(c_0_17,plain,
( X2 = X3
| X1 = X3
| X1 = X2
| vf(X1,X2) = vf(X1,X3)
| rless(vf(X1,X2),vf(X1,X3))
| rless(vf(X1,X3),vf(X1,X2))
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| X3 != X4
| ~ rpoint(X4)
| X2 != X5
| ~ rpoint(X5)
| X1 != X6
| ~ rpoint(X6) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( vf(X1,X2) = vf(X1,X3)
| X2 = X3
| X1 = X3
| X1 = X2
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| ~ rless(vf(X1,X3),vf(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])])]) ).
cnf(c_0_19,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
vd1352 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
vd1354 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
vd1353 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(384, 1360, 0)'])]) ).
cnf(c_0_26,plain,
( vf(X1,X2) = vf(X1,X3)
| X2 = X3
| X1 = X3
| X1 = X2
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])])]),c_0_18]),c_0_18]) ).
cnf(c_0_27,plain,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
inference(split_conjunct,[status(thm)],['holds(383, 1356, 0)']) ).
cnf(c_0_28,plain,
rpoint(vd1352),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
rpoint(vd1354),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
rpoint(vd1353),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
vd1352 != vd1354,
inference(split_conjunct,[status(thm)],['pred(383, 8)']) ).
cnf(c_0_33,plain,
vd1352 != vd1353,
inference(split_conjunct,[status(thm)],['pred(383, 7)']) ).
cnf(c_0_34,plain,
vd1353 != vd1354,
inference(split_conjunct,[status(thm)],['pred(383, 9)']) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_26,c_0_27]),c_0_28]),c_0_29]),c_0_30])]),c_0_31]),c_0_32]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO331+1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.12/0.32 % Computer : n002.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon May 4 17:53:16 EDT 2026
% 0.12/0.32 % CPUTime :
% 0.12/0.33 % start to proof: theBenchmark
% 1.56/1.83 % Version : CSE_E---1.7
% 1.56/1.83 % Problem : theBenchmark.p
% 1.56/1.83 % SZS status Theorem for theBenchmark.p
% 1.56/1.83 % SZS output start CNFRefutation
% See solution above
% 1.56/1.83 % Total time : 1.427s
%------------------------------------------------------------------------------