TSTP Solution File: SWV048+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV048+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 : Mon Jun 24 17:09:04 EDT 2024
% Result : Theorem 0.39s 1.07s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X22] : n0 = sum(n0,tptp_minus_1,X22),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_plus_base) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : succ(X0) = plus(X0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_r) ).
fof(f30,axiom,
! [X0] : succ(X0) = plus(n1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_succ) ).
fof(f41,axiom,
! [X0] : succ(pred(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_pred) ).
fof(f51,axiom,
true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ttrue) ).
fof(f53,conjecture,
( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0016) ).
fof(f54,negated_conjecture,
~ ( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f106,plain,
! [X0] : n0 = sum(n0,tptp_minus_1,X0),
inference(rectify,[],[f26]) ).
fof(f154,plain,
( ( ( ~ true
& n0 = pv78 )
| ( ( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
& n0 != pv78 ) )
& leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f155,plain,
( ( ( ~ true
& n0 = pv78 )
| ( ( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
& n0 != pv78 ) )
& leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
inference(flattening,[],[f154]) ).
fof(f299,plain,
! [X0] : n0 = sum(n0,tptp_minus_1,X0),
inference(cnf_transformation,[],[f106]) ).
fof(f301,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f302,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f303,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f312,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f313,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f314,plain,
! [X0] : succ(pred(X0)) = X0,
inference(cnf_transformation,[],[f41]) ).
fof(f331,plain,
true,
inference(cnf_transformation,[],[f51]) ).
fof(f333,plain,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(cnf_transformation,[],[f155]) ).
fof(f334,plain,
leq(n0,pv35),
inference(cnf_transformation,[],[f155]) ).
fof(f335,plain,
leq(pv35,minus(n5,n1)),
inference(cnf_transformation,[],[f155]) ).
fof(f337,plain,
( n0 = pv78
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
inference(cnf_transformation,[],[f155]) ).
fof(f339,plain,
( ~ true
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
inference(cnf_transformation,[],[f155]) ).
fof(f385,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f301,f302]) ).
fof(f386,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f303,f302]) ).
fof(f395,plain,
! [X0] : minus(plus(X0,n1),n1) = X0,
inference(definition_unfolding,[],[f313,f312,f302]) ).
fof(f396,plain,
! [X0] : plus(minus(X0,n1),n1) = X0,
inference(definition_unfolding,[],[f314,f302,f312]) ).
cnf(c_126,plain,
sum(n0,tptp_minus_1,X0) = n0,
inference(cnf_transformation,[],[f299]) ).
cnf(c_128,plain,
plus(tptp_minus_1,n1) = n0,
inference(cnf_transformation,[],[f385]) ).
cnf(c_129,plain,
plus(X0,n1) = plus(n1,X0),
inference(cnf_transformation,[],[f386]) ).
cnf(c_138,plain,
minus(plus(X0,n1),n1) = X0,
inference(cnf_transformation,[],[f395]) ).
cnf(c_139,plain,
plus(minus(X0,n1),n1) = X0,
inference(cnf_transformation,[],[f396]) ).
cnf(c_156,plain,
true,
inference(cnf_transformation,[],[f331]) ).
cnf(c_158,negated_conjecture,
( sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0
| sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| ~ true ),
inference(cnf_transformation,[],[f339]) ).
cnf(c_160,negated_conjecture,
( sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0
| sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| n0 = pv78 ),
inference(cnf_transformation,[],[f337]) ).
cnf(c_161,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(cnf_transformation,[],[f335]) ).
cnf(c_162,negated_conjecture,
leq(n0,pv35),
inference(cnf_transformation,[],[f334]) ).
cnf(c_163,negated_conjecture,
sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) = pv78,
inference(cnf_transformation,[],[f333]) ).
cnf(c_297,negated_conjecture,
sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0,
inference(global_subsumption_just,[status(thm)],[c_160,c_156,c_162,c_161,c_163,c_158]) ).
cnf(c_1634,plain,
plus(n1,minus(X0,n1)) = X0,
inference(demodulation,[status(thm)],[c_139,c_129]) ).
cnf(c_1636,plain,
plus(n1,tptp_minus_1) = n0,
inference(demodulation,[status(thm)],[c_128,c_129]) ).
cnf(c_11241,plain,
minus(n0,n1) = sP0_iProver_def,
definition ).
cnf(c_11242,plain,
a_select3(q,pv81,pv35) = sP1_iProver_def,
definition ).
cnf(c_11243,plain,
a_select2(x,pv81) = sP2_iProver_def,
definition ).
cnf(c_11244,plain,
times(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_11245,plain,
sum(n0,sP0_iProver_def,sP3_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_11250,negated_conjecture,
sP4_iProver_def != n0,
inference(demodulation,[status(thm)],[c_297,c_11243,c_11242,c_11244,c_11241,c_11245]) ).
cnf(c_14422,plain,
plus(X0,n1) = plus(n1,X0),
inference(superposition,[status(thm)],[c_138,c_1634]) ).
cnf(c_14485,plain,
minus(plus(n1,X0),n1) = X0,
inference(superposition,[status(thm)],[c_14422,c_138]) ).
cnf(c_14698,plain,
minus(n0,n1) = tptp_minus_1,
inference(superposition,[status(thm)],[c_1636,c_14485]) ).
cnf(c_15109,plain,
tptp_minus_1 = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_14698,c_11241]) ).
cnf(c_15113,plain,
sum(n0,sP0_iProver_def,X0) = n0,
inference(superposition,[status(thm)],[c_15109,c_126]) ).
cnf(c_15122,plain,
n0 = sP4_iProver_def,
inference(demodulation,[status(thm)],[c_11245,c_15113]) ).
cnf(c_15155,plain,
sP4_iProver_def != sP4_iProver_def,
inference(demodulation,[status(thm)],[c_11250,c_15122]) ).
cnf(c_15161,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_15155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV048+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Thu Jun 20 20:28:54 EDT 2024
% 0.09/0.31 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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
% 0.39/1.07 % SZS status Started for theBenchmark.p
% 0.39/1.07 % SZS status Theorem for theBenchmark.p
% 0.39/1.07
% 0.39/1.07 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.39/1.07
% 0.39/1.07 ------ iProver source info
% 0.39/1.07
% 0.39/1.07 git: date: 2024-06-12 09:56:46 +0000
% 0.39/1.07 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.39/1.07 git: non_committed_changes: false
% 0.39/1.07
% 0.39/1.07 ------ Parsing...
% 0.39/1.07 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.39/1.07
% 0.39/1.07 ------ Preprocessing... sup_sim: 16 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.39/1.07
% 0.39/1.07 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.39/1.07
% 0.39/1.07 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.39/1.07 ------ Proving...
% 0.39/1.07 ------ Problem Properties
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07 clauses 161
% 0.39/1.07 conjectures 5
% 0.39/1.07 EPR 48
% 0.39/1.07 Horn 111
% 0.39/1.07 unary 67
% 0.39/1.07 binary 34
% 0.39/1.07 lits 500
% 0.39/1.07 lits eq 125
% 0.39/1.07 fd_pure 0
% 0.39/1.07 fd_pseudo 0
% 0.39/1.07 fd_cond 6
% 0.39/1.07 fd_pseudo_cond 4
% 0.39/1.07 AC symbols 0
% 0.39/1.07
% 0.39/1.07 ------ Input Options Time Limit: Unbounded
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07 ------
% 0.39/1.07 Current options:
% 0.39/1.07 ------
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07 ------ Proving...
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07 ------ Proving...
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07 ------ Proving...
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07 ------ Proving...
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07 ------ Proving...
% 0.39/1.07
% 0.39/1.07
% 0.39/1.07 % SZS status Theorem for theBenchmark.p
% 0.39/1.07
% 0.39/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.39/1.07
% 4.12/1.08
%------------------------------------------------------------------------------