%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV189+1 : TPTP v9.2.1. Bugfixed v3.3.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 : n009.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 05:21:02 PM UTC 2026
% Result : Theorem 1.29s 1.72s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 64 ( 11 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 58 ( 20 ~; 14 |; 13 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0121,conjecture,
( ! [X14] :
( ( leq(n0,X14)
& leq(X14,n4) )
=> a_select3(center_init,X14,n0) = init )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,tptp_minus_1) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select3(q_init,X18,X4) = init ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0121) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finite_domain_0) ).
fof(gt_0_tptp_minus_1,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_0_tptp_minus_1) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X14] :
( ( leq(n0,X14)
& leq(X14,n4) )
=> a_select3(center_init,X14,n0) = init )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,tptp_minus_1) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select3(q_init,X18,X4) = init ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_init_0121]) ).
fof(c_0_7,plain,
! [X213,X214] :
( ~ gt(X214,X213)
| leq(X213,X214) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
fof(c_0_8,plain,
! [X206,X207,X208] :
( ~ leq(X206,X207)
| ~ leq(X207,X208)
| leq(X206,X208) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
fof(c_0_9,negated_conjecture,
! [X357] :
( ( ~ leq(n0,X357)
| ~ leq(X357,n4)
| a_select3(center_init,X357,n0) = init )
& leq(n0,esk24_0)
& leq(esk24_0,tptp_minus_1)
& leq(n0,esk25_0)
& leq(esk25_0,n4)
& a_select3(q_init,esk24_0,esk25_0) != init ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_10,plain,
! [X362] :
( ~ leq(n0,X362)
| ~ leq(X362,n0)
| X362 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_11,plain,
( leq(X2,X1)
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
gt(n0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[gt_0_tptp_minus_1]) ).
cnf(c_0_13,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
leq(esk24_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( X1 = n0
| ~ leq(n0,X1)
| ~ leq(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
leq(tptp_minus_1,n0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk24_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
leq(n0,esk24_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_19,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_20,plain,
( tptp_minus_1 = n0
| ~ leq(n0,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_22,plain,
! [X204] : ~ gt(X204,X204),
inference(variable_rename,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
tptp_minus_1 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_24,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV189+1 : TPTP v9.2.1. Bugfixed v3.3.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.13/0.32 % Computer : n009.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 04:56:56 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.29/1.72 % Version : CSE_E---1.7
% 1.29/1.72 % Problem : theBenchmark.p
% 1.29/1.72 % SZS status Theorem for theBenchmark.p
% 1.29/1.72 % SZS output start CNFRefutation
% See solution above
% 1.29/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------