TSTP Solution File: SWV175+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV175+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 : Fri May 3 03:13:40 EDT 2024
% Result : Theorem 4.28s 1.20s
% Output : CNFRefutation 4.28s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [X27] :
( ( leq(X27,n4)
& leq(n0,X27) )
=> init = a_select2(sigmaold_init,X27) ) )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> init = a_select2(rhoold_init,X21) ) )
& ( gt(loopcounter,n1)
=> ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> init = a_select2(muold_init,X20) ) )
& ! [X19] :
( ( leq(X19,n4)
& leq(n0,X19) )
=> init = a_select3(center_init,X19,n0) )
& ! [X3] :
( ( leq(X3,pred(pv28))
& leq(n0,X3) )
=> init = a_select2(rho_init,X3) )
& ! [X13] :
( ( leq(X13,n135299)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) )
=> init = a_select3(q_init,pv30,pv28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0051) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [X27] :
( ( leq(X27,n4)
& leq(n0,X27) )
=> init = a_select2(sigmaold_init,X27) ) )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(X21,n4)
& leq(n0,X21) )
=> init = a_select2(rhoold_init,X21) ) )
& ( gt(loopcounter,n1)
=> ! [X20] :
( ( leq(X20,n4)
& leq(n0,X20) )
=> init = a_select2(muold_init,X20) ) )
& ! [X19] :
( ( leq(X19,n4)
& leq(n0,X19) )
=> init = a_select3(center_init,X19,n0) )
& ! [X3] :
( ( leq(X3,pred(pv28))
& leq(n0,X3) )
=> init = a_select2(rho_init,X3) )
& ! [X13] :
( ( leq(X13,n135299)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,n4)
& leq(n0,X17) )
=> a_select3(q_init,X13,X17) = init ) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) )
=> init = a_select3(q_init,pv30,pv28) ),
inference(negated_conjecture,[],[f53]) ).
fof(f114,plain,
~ ( ( ( gt(loopcounter,n1)
=> ! [X0] :
( ( leq(X0,n4)
& leq(n0,X0) )
=> init = a_select2(sigmaold_init,X0) ) )
& ( gt(loopcounter,n1)
=> ! [X1] :
( ( leq(X1,n4)
& leq(n0,X1) )
=> init = a_select2(rhoold_init,X1) ) )
& ( gt(loopcounter,n1)
=> ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> init = a_select2(muold_init,X2) ) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select3(center_init,X3,n0) )
& ! [X4] :
( ( leq(X4,pred(pv28))
& leq(n0,X4) )
=> init = a_select2(rho_init,X4) )
& ! [X5] :
( ( leq(X5,n135299)
& leq(n0,X5) )
=> ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> init = a_select3(q_init,X5,X6) ) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) )
=> init = a_select3(q_init,pv30,pv28) ),
inference(rectify,[],[f54]) ).
fof(f156,plain,
( init != a_select3(q_init,pv30,pv28)
& ( ! [X0] :
( init = a_select2(sigmaold_init,X0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) )
| ~ gt(loopcounter,n1) )
& ( ! [X1] :
( init = a_select2(rhoold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(muold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ! [X3] :
( init = a_select3(center_init,X3,n0)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
& ! [X4] :
( init = a_select2(rho_init,X4)
| ~ leq(X4,pred(pv28))
| ~ leq(n0,X4) )
& ! [X5] :
( ! [X6] :
( init = a_select3(q_init,X5,X6)
| ~ leq(X6,n4)
| ~ leq(n0,X6) )
| ~ leq(X5,n135299)
| ~ leq(n0,X5) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) ),
inference(ennf_transformation,[],[f114]) ).
fof(f157,plain,
( init != a_select3(q_init,pv30,pv28)
& ( ! [X0] :
( init = a_select2(sigmaold_init,X0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) )
| ~ gt(loopcounter,n1) )
& ( ! [X1] :
( init = a_select2(rhoold_init,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X1) )
| ~ gt(loopcounter,n1) )
& ( ! [X2] :
( init = a_select2(muold_init,X2)
| ~ leq(X2,n4)
| ~ leq(n0,X2) )
| ~ gt(loopcounter,n1) )
& ! [X3] :
( init = a_select3(center_init,X3,n0)
| ~ leq(X3,n4)
| ~ leq(n0,X3) )
& ! [X4] :
( init = a_select2(rho_init,X4)
| ~ leq(X4,pred(pv28))
| ~ leq(n0,X4) )
& ! [X5] :
( ! [X6] :
( init = a_select3(q_init,X5,X6)
| ~ leq(X6,n4)
| ~ leq(n0,X6) )
| ~ leq(X5,n135299)
| ~ leq(n0,X5) )
& leq(pv30,n135299)
& leq(pv28,n4)
& leq(n0,pv30)
& leq(n0,pv28) ),
inference(flattening,[],[f156]) ).
fof(f334,plain,
leq(n0,pv28),
inference(cnf_transformation,[],[f157]) ).
fof(f335,plain,
leq(n0,pv30),
inference(cnf_transformation,[],[f157]) ).
fof(f336,plain,
leq(pv28,n4),
inference(cnf_transformation,[],[f157]) ).
fof(f337,plain,
leq(pv30,n135299),
inference(cnf_transformation,[],[f157]) ).
fof(f338,plain,
! [X6,X5] :
( init = a_select3(q_init,X5,X6)
| ~ leq(X6,n4)
| ~ leq(n0,X6)
| ~ leq(X5,n135299)
| ~ leq(n0,X5) ),
inference(cnf_transformation,[],[f157]) ).
fof(f344,plain,
init != a_select3(q_init,pv30,pv28),
inference(cnf_transformation,[],[f157]) ).
cnf(c_157,negated_conjecture,
a_select3(q_init,pv30,pv28) != init,
inference(cnf_transformation,[],[f344]) ).
cnf(c_163,negated_conjecture,
( ~ leq(X0,n135299)
| ~ leq(X1,n4)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| a_select3(q_init,X0,X1) = init ),
inference(cnf_transformation,[],[f338]) ).
cnf(c_164,negated_conjecture,
leq(pv30,n135299),
inference(cnf_transformation,[],[f337]) ).
cnf(c_165,negated_conjecture,
leq(pv28,n4),
inference(cnf_transformation,[],[f336]) ).
cnf(c_166,negated_conjecture,
leq(n0,pv30),
inference(cnf_transformation,[],[f335]) ).
cnf(c_167,negated_conjecture,
leq(n0,pv28),
inference(cnf_transformation,[],[f334]) ).
cnf(c_5941,plain,
a_select3(q_init,pv30,pv28) = sP1_iProver_def,
definition ).
cnf(c_5942,negated_conjecture,
leq(n0,pv28),
inference(demodulation,[status(thm)],[c_167]) ).
cnf(c_5943,negated_conjecture,
leq(n0,pv30),
inference(demodulation,[status(thm)],[c_166]) ).
cnf(c_5944,negated_conjecture,
leq(pv28,n4),
inference(demodulation,[status(thm)],[c_165]) ).
cnf(c_5945,negated_conjecture,
leq(pv30,n135299),
inference(demodulation,[status(thm)],[c_164]) ).
cnf(c_5946,negated_conjecture,
( ~ leq(X0,n135299)
| ~ leq(X1,n4)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| a_select3(q_init,X0,X1) = init ),
inference(demodulation,[status(thm)],[c_163]) ).
cnf(c_5952,negated_conjecture,
sP1_iProver_def != init,
inference(demodulation,[status(thm)],[c_157,c_5941]) ).
cnf(c_9059,plain,
( ~ leq(X0,n4)
| ~ leq(n0,X0)
| ~ leq(pv30,n135299)
| a_select3(q_init,pv30,X0) = init ),
inference(superposition,[status(thm)],[c_5943,c_5946]) ).
cnf(c_9065,plain,
( ~ leq(X0,n4)
| ~ leq(n0,X0)
| a_select3(q_init,pv30,X0) = init ),
inference(forward_subsumption_resolution,[status(thm)],[c_9059,c_5945]) ).
cnf(c_9151,plain,
( ~ leq(pv28,n4)
| a_select3(q_init,pv30,pv28) = init ),
inference(superposition,[status(thm)],[c_5942,c_9065]) ).
cnf(c_9152,plain,
( ~ leq(pv28,n4)
| init = sP1_iProver_def ),
inference(light_normalisation,[status(thm)],[c_9151,c_5941]) ).
cnf(c_9153,plain,
init = sP1_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_9152,c_5944]) ).
cnf(c_9180,plain,
sP1_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_5952,c_9153]) ).
cnf(c_9181,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_9180]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV175+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 00:46:50 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.28/1.20 % SZS status Started for theBenchmark.p
% 4.28/1.20 % SZS status Theorem for theBenchmark.p
% 4.28/1.20
% 4.28/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.28/1.20
% 4.28/1.20 ------ iProver source info
% 4.28/1.20
% 4.28/1.20 git: date: 2024-05-02 19:28:25 +0000
% 4.28/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.28/1.20 git: non_committed_changes: false
% 4.28/1.20
% 4.28/1.20 ------ Parsing...
% 4.28/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.28/1.20
% 4.28/1.20 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 4.28/1.20
% 4.28/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.28/1.20
% 4.28/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.28/1.20 ------ Proving...
% 4.28/1.20 ------ Problem Properties
% 4.28/1.20
% 4.28/1.20
% 4.28/1.20 clauses 160
% 4.28/1.20 conjectures 11
% 4.28/1.20 EPR 48
% 4.28/1.20 Horn 110
% 4.28/1.20 unary 60
% 4.28/1.20 binary 34
% 4.28/1.20 lits 516
% 4.28/1.20 lits eq 122
% 4.28/1.20 fd_pure 0
% 4.28/1.20 fd_pseudo 0
% 4.28/1.20 fd_cond 6
% 4.28/1.20 fd_pseudo_cond 4
% 4.28/1.20 AC symbols 0
% 4.28/1.20
% 4.28/1.20 ------ Schedule dynamic 5 is on
% 4.28/1.20
% 4.28/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.28/1.20
% 4.28/1.20
% 4.28/1.20 ------
% 4.28/1.20 Current options:
% 4.28/1.20 ------
% 4.28/1.20
% 4.28/1.20
% 4.28/1.20
% 4.28/1.20
% 4.28/1.20 ------ Proving...
% 4.28/1.20
% 4.28/1.20
% 4.28/1.20 % SZS status Theorem for theBenchmark.p
% 4.28/1.20
% 4.28/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.28/1.20
% 4.28/1.20
%------------------------------------------------------------------------------