TSTP Solution File: SWV069+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV069+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:25 EDT 2024
% Result : Theorem 3.67s 1.14s
% Output : CNFRefutation 3.67s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : leq(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_leq) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt_pred) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f53,conjecture,
( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).
fof(f54,negated_conjecture,
~ ( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f66,axiom,
gt(n5,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_5_0) ).
fof(f155,plain,
( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
inference(ennf_transformation,[],[f54]) ).
fof(f156,plain,
( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
inference(flattening,[],[f155]) ).
fof(f176,plain,
! [X0,X1] :
( ( leq(X0,pred(X1))
| ~ gt(X1,X0) )
& ( gt(X1,X0)
| ~ leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f226,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f231,plain,
! [X0,X1] :
( leq(X0,pred(X1))
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f313,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f333,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f156]) ).
fof(f334,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f156]) ).
fof(f335,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f347,plain,
gt(n5,n0),
inference(cnf_transformation,[],[f66]) ).
fof(f375,plain,
! [X0,X1] :
( leq(X0,minus(X1,n1))
| ~ gt(X1,X0) ),
inference(definition_unfolding,[],[f231,f313]) ).
cnf(c_52,plain,
leq(X0,X0),
inference(cnf_transformation,[],[f226]) ).
cnf(c_56,plain,
( ~ gt(X0,X1)
| leq(X1,minus(X0,n1)) ),
inference(cnf_transformation,[],[f375]) ).
cnf(c_157,negated_conjecture,
( ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,n0)
| ~ leq(n0,pv10) ),
inference(cnf_transformation,[],[f335]) ).
cnf(c_158,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f334]) ).
cnf(c_159,negated_conjecture,
leq(n0,pv10),
inference(cnf_transformation,[],[f333]) ).
cnf(c_171,plain,
gt(n5,n0),
inference(cnf_transformation,[],[f347]) ).
cnf(c_199,plain,
leq(n0,n0),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_289,negated_conjecture,
~ leq(n0,minus(n5,n1)),
inference(global_subsumption_just,[status(thm)],[c_157,c_159,c_199,c_158,c_157]) ).
cnf(c_5819,plain,
minus(n5,n1) = sP0_iProver_def,
definition ).
cnf(c_5821,negated_conjecture,
~ leq(n0,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_289,c_5819]) ).
cnf(c_8783,plain,
( ~ gt(n5,X0)
| leq(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_5819,c_56]) ).
cnf(c_8794,plain,
( ~ gt(n5,n0)
| leq(n0,sP0_iProver_def) ),
inference(instantiation,[status(thm)],[c_8783]) ).
cnf(c_8795,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8794,c_5821,c_171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV069+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri May 3 00:45:22 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.67/1.14 % SZS status Started for theBenchmark.p
% 3.67/1.14 % SZS status Theorem for theBenchmark.p
% 3.67/1.14
% 3.67/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.67/1.14
% 3.67/1.14 ------ iProver source info
% 3.67/1.14
% 3.67/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.67/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.67/1.14 git: non_committed_changes: false
% 3.67/1.14
% 3.67/1.14 ------ Parsing...
% 3.67/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.67/1.14
% 3.67/1.14 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.67/1.14
% 3.67/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.67/1.14
% 3.67/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.67/1.14 ------ Proving...
% 3.67/1.14 ------ Problem Properties
% 3.67/1.14
% 3.67/1.14
% 3.67/1.14 clauses 152
% 3.67/1.14 conjectures 3
% 3.67/1.14 EPR 46
% 3.67/1.14 Horn 102
% 3.67/1.14 unary 58
% 3.67/1.14 binary 34
% 3.67/1.14 lits 491
% 3.67/1.14 lits eq 115
% 3.67/1.14 fd_pure 0
% 3.67/1.14 fd_pseudo 0
% 3.67/1.14 fd_cond 6
% 3.67/1.14 fd_pseudo_cond 4
% 3.67/1.14 AC symbols 0
% 3.67/1.14
% 3.67/1.14 ------ Schedule dynamic 5 is on
% 3.67/1.14
% 3.67/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.67/1.14
% 3.67/1.14
% 3.67/1.14 ------
% 3.67/1.14 Current options:
% 3.67/1.14 ------
% 3.67/1.14
% 3.67/1.14
% 3.67/1.14
% 3.67/1.14
% 3.67/1.14 ------ Proving...
% 3.67/1.14
% 3.67/1.14
% 3.67/1.14 % SZS status Theorem for theBenchmark.p
% 3.67/1.14
% 3.67/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.67/1.14
% 3.67/1.14
%------------------------------------------------------------------------------