TSTP Solution File: SWV408+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV408+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:14:21 EDT 2024
% Result : Theorem 3.94s 1.14s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 15 unt; 0 def)
% Number of atoms : 115 ( 16 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 121 ( 47 ~; 41 |; 26 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 85 ( 4 sgn 55 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] : ~ contains_slb(create_slb,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( create_slb != X1
=> findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(f41,axiom,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax53) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( strictly_less_than(X1,X2)
& contains_slb(X0,X1) )
=> ( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
| pair_in_list(update_slb(X0,X2),X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l44_l45) ).
fof(f43,conjecture,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) )
=> ( ? [X4] :
( less_than(findmin_pqp_res(X0),X4)
& pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l44_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) )
=> ( ? [X4] :
( less_than(findmin_pqp_res(X0),X4)
& pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ) ),
inference(negated_conjecture,[],[f43]) ).
fof(f52,plain,
! [X0,X1,X2] :
( create_slb != X1
=> findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(rectify,[],[f39]) ).
fof(f79,plain,
! [X0,X1,X2] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(ennf_transformation,[],[f52]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X0,X1) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(findmin_pqp_res(X0),X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
& ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f44]) ).
fof(f83,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(findmin_pqp_res(X0),X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
& ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) ),
inference(flattening,[],[f82]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
=> ( less_than(X2,sK0(X0,X1,X2))
& pair_in_list(update_slb(X0,X2),X1,sK0(X0,X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( less_than(X2,sK0(X0,X1,X2))
& pair_in_list(update_slb(X0,X2),X1,sK0(X0,X1,X2)) )
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f81,f92]) ).
fof(f94,plain,
( ? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(findmin_pqp_res(X0),X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
& ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) )
=> ( ! [X4] :
( ~ less_than(findmin_pqp_res(sK1),X4)
| ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X4) )
& ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1))
& strictly_less_than(sK4,findmin_cpq_res(triple(sK1,sK2,sK3)))
& contains_slb(sK2,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f95,plain,
( ! [X4] :
( ~ less_than(findmin_pqp_res(sK1),X4)
| ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X4) )
& ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1))
& strictly_less_than(sK4,findmin_cpq_res(triple(sK1,sK2,sK3)))
& contains_slb(sK2,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f83,f94]) ).
fof(f105,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f143,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(cnf_transformation,[],[f79]) ).
fof(f145,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f41]) ).
fof(f146,plain,
! [X2,X0,X1] :
( pair_in_list(update_slb(X0,X2),X1,sK0(X0,X1,X2))
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f147,plain,
! [X2,X0,X1] :
( less_than(X2,sK0(X0,X1,X2))
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f148,plain,
contains_slb(sK2,sK4),
inference(cnf_transformation,[],[f95]) ).
fof(f149,plain,
strictly_less_than(sK4,findmin_cpq_res(triple(sK1,sK2,sK3))),
inference(cnf_transformation,[],[f95]) ).
fof(f150,plain,
~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1)),
inference(cnf_transformation,[],[f95]) ).
fof(f151,plain,
! [X4] :
( ~ less_than(findmin_pqp_res(sK1),X4)
| ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X4) ),
inference(cnf_transformation,[],[f95]) ).
fof(f155,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(definition_unfolding,[],[f143,f145]) ).
fof(f156,plain,
strictly_less_than(sK4,removemin_cpq_res(triple(sK1,sK2,sK3))),
inference(definition_unfolding,[],[f149,f145]) ).
cnf(c_58,plain,
~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f105]) ).
cnf(c_96,plain,
( removemin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| X1 = create_slb ),
inference(cnf_transformation,[],[f155]) ).
cnf(c_97,plain,
( ~ strictly_less_than(X0,X1)
| ~ contains_slb(X2,X0)
| less_than(X1,sK0(X2,X0,X1))
| pair_in_list(update_slb(X2,X1),X0,X1) ),
inference(cnf_transformation,[],[f147]) ).
cnf(c_98,plain,
( ~ strictly_less_than(X0,X1)
| ~ contains_slb(X2,X0)
| pair_in_list(update_slb(X2,X1),X0,sK0(X2,X0,X1))
| pair_in_list(update_slb(X2,X1),X0,X1) ),
inference(cnf_transformation,[],[f146]) ).
cnf(c_99,negated_conjecture,
( ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X0)
| ~ less_than(findmin_pqp_res(sK1),X0) ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_100,negated_conjecture,
~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1)),
inference(cnf_transformation,[],[f150]) ).
cnf(c_101,negated_conjecture,
strictly_less_than(sK4,removemin_cpq_res(triple(sK1,sK2,sK3))),
inference(cnf_transformation,[],[f156]) ).
cnf(c_102,negated_conjecture,
contains_slb(sK2,sK4),
inference(cnf_transformation,[],[f148]) ).
cnf(c_518,plain,
( create_slb = sK2
| strictly_less_than(sK4,findmin_pqp_res(sK1)) ),
inference(superposition,[status(thm)],[c_96,c_101]) ).
cnf(c_720,plain,
( ~ less_than(findmin_pqp_res(sK1),sK0(sK2,sK4,findmin_pqp_res(sK1)))
| ~ strictly_less_than(sK4,findmin_pqp_res(sK1))
| ~ contains_slb(sK2,sK4)
| pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1)) ),
inference(superposition,[status(thm)],[c_98,c_99]) ).
cnf(c_729,plain,
( ~ strictly_less_than(sK4,findmin_pqp_res(sK1))
| ~ contains_slb(sK2,sK4)
| pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_720,c_97]) ).
cnf(c_1071,plain,
create_slb = sK2,
inference(global_subsumption_just,[status(thm)],[c_518,c_102,c_100,c_518,c_729]) ).
cnf(c_1101,plain,
~ contains_slb(sK2,X0),
inference(demodulation,[status(thm)],[c_58,c_1071]) ).
cnf(c_4137,plain,
$false,
inference(superposition,[status(thm)],[c_102,c_1101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV408+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n031.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 01:03:01 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 3.94/1.14 % SZS status Started for theBenchmark.p
% 3.94/1.14 % SZS status Theorem for theBenchmark.p
% 3.94/1.14
% 3.94/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.94/1.14
% 3.94/1.14 ------ iProver source info
% 3.94/1.14
% 3.94/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.94/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.94/1.14 git: non_committed_changes: false
% 3.94/1.14
% 3.94/1.14 ------ Parsing...
% 3.94/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.94/1.14
% 3.94/1.14 ------ Preprocessing... sup_sim: 1 pe_s pe:1:0s pe_e
% 3.94/1.14
% 3.94/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e
% 3.94/1.14
% 3.94/1.14 ------ Preprocessing...
% 3.94/1.14 ------ Proving...
% 3.94/1.14 ------ Problem Properties
% 3.94/1.14
% 3.94/1.14
% 3.94/1.14 clauses 54
% 3.94/1.14 conjectures 4
% 3.94/1.14 EPR 10
% 3.94/1.14 Horn 37
% 3.94/1.14 unary 19
% 3.94/1.14 binary 20
% 3.94/1.14 lits 107
% 3.94/1.14 lits eq 30
% 3.94/1.14 fd_pure 0
% 3.94/1.14 fd_pseudo 0
% 3.94/1.14 fd_cond 5
% 3.94/1.14 fd_pseudo_cond 5
% 3.94/1.14 AC symbols 0
% 3.94/1.14
% 3.94/1.14 ------ Input Options Time Limit: Unbounded
% 3.94/1.14
% 3.94/1.14
% 3.94/1.14 ------
% 3.94/1.14 Current options:
% 3.94/1.14 ------
% 3.94/1.14
% 3.94/1.14
% 3.94/1.14
% 3.94/1.14
% 3.94/1.14 ------ Proving...
% 3.94/1.14
% 3.94/1.14
% 3.94/1.14 % SZS status Theorem for theBenchmark.p
% 3.94/1.14
% 3.94/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.94/1.14
% 3.94/1.14
%------------------------------------------------------------------------------