%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV188+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 : n023.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.31s 1.73s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 98 ( 20 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 89 ( 18 ~; 12 |; 31 &)
% ( 1 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 39 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0116,conjecture,
( ( ! [X14] :
( ( leq(n0,X14)
& leq(X14,n135299) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n4) )
=> a_select3(q_init,X14,X18) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(rho_init,X4) = init )
& ! [X20] :
( ( leq(n0,X20)
& leq(X20,n4) )
=> a_select3(center_init,X20,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> a_select2(muold_init,X21) = init ) )
& ( gt(loopcounter,n1)
=> ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select2(rhoold_init,X22) = init ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(sigmaold_init,X28) = init ) ) )
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,tptp_minus_1) )
=> a_select2(mu_init,X29) = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0116) ).
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,plain,
( epred2_0
<=> ( ! [X14] :
( ( leq(n0,X14)
& leq(X14,n135299) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n4) )
=> a_select3(q_init,X14,X18) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(rho_init,X4) = init )
& ! [X20] :
( ( leq(n0,X20)
& leq(X20,n4) )
=> a_select3(center_init,X20,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> a_select2(muold_init,X21) = init ) )
& ( gt(loopcounter,n1)
=> ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select2(rhoold_init,X22) = init ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(sigmaold_init,X28) = init ) ) ) ),
introduced(definition) ).
fof(c_0_7,negated_conjecture,
~ ( epred2_0
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,tptp_minus_1) )
=> a_select2(mu_init,X29) = init ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0116]),c_0_6]) ).
fof(c_0_8,plain,
! [X220,X221] :
( ~ gt(X221,X220)
| leq(X220,X221) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
fof(c_0_9,plain,
! [X213,X214,X215] :
( ~ leq(X213,X214)
| ~ leq(X214,X215)
| leq(X213,X215) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
fof(c_0_10,negated_conjecture,
( epred2_0
& leq(n0,esk24_0)
& leq(esk24_0,tptp_minus_1)
& a_select2(mu_init,esk24_0) != init ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X367] :
( ~ leq(n0,X367)
| ~ leq(X367,n0)
| X367 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_12,plain,
( leq(X2,X1)
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
gt(n0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[gt_0_tptp_minus_1]) ).
cnf(c_0_14,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
leq(esk24_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( X1 = n0
| ~ leq(n0,X1)
| ~ leq(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
leq(tptp_minus_1,n0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk24_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
leq(n0,esk24_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_20,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_21,plain,
( tptp_minus_1 = n0
| ~ leq(n0,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X211] : ~ gt(X211,X211),
inference(variable_rename,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
tptp_minus_1 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV188+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.14/0.32 % Computer : n023.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 04:57:54 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.31/1.73 % Version : CSE_E---1.7
% 1.31/1.73 % Problem : theBenchmark.p
% 1.31/1.73 % SZS status Theorem for theBenchmark.p
% 1.31/1.73 % SZS output start CNFRefutation
% See solution above
% 1.31/1.73 % Total time : 1.373s
%------------------------------------------------------------------------------