TSTP Solution File: SWV372+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV372+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 : Thu Aug 31 22:32:45 EDT 2023
% Result : Theorem 4.00s 1.18s
% Output : CNFRefutation 4.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 21 unt; 0 def)
% Number of atoms : 106 ( 38 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 85 ( 36 ~; 30 |; 8 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 118 ( 15 sgn; 85 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax39) ).
fof(f40,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f46,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f47,axiom,
! [X0,X1,X2,X3] :
( ( ~ contains_slb(X1,findmin_pqp_res(X0))
& create_slb != X1 )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).
fof(f51,axiom,
! [X0,X1,X2,X3] :
( create_slb != X1
=> findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).
fof(f53,axiom,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax53) ).
fof(f63,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_pq(i(triple(X0,X1,X2)),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_li56) ).
fof(f65,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ phi(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_lX) ).
fof(f66,conjecture,
! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_co) ).
fof(f67,negated_conjecture,
~ ! [X0,X1,X2] :
( phi(findmin_cpq_eff(triple(X0,X1,X2)))
=> contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(negated_conjecture,[],[f66]) ).
fof(f70,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f40]) ).
fof(f71,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f70]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ( ~ contains_slb(X1,findmin_pqp_res(X0))
& create_slb != X1 )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f47]) ).
fof(f75,plain,
! [X0,X1,X2] :
( create_slb != X1
=> findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(rectify,[],[f51]) ).
fof(f111,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(ennf_transformation,[],[f72]) ).
fof(f112,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(flattening,[],[f111]) ).
fof(f117,plain,
! [X0,X1,X2] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(ennf_transformation,[],[f75]) ).
fof(f119,plain,
! [X0,X1,X2] :
( ~ phi(triple(X0,X1,X2))
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f120,plain,
? [X0,X1,X2] :
( ~ contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
& phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f67]) ).
fof(f130,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) )
& ( contains_slb(X1,X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f135,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_pq(i(triple(X0,X1,X2)),X3) )
& ( contains_pq(i(triple(X0,X1,X2)),X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f136,plain,
( ? [X0,X1,X2] :
( ~ contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
& phi(findmin_cpq_eff(triple(X0,X1,X2))) )
=> ( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4)))
& phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4)))
& phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f120,f136]) ).
fof(f186,plain,
! [X2,X3,X0,X1] :
( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f130]) ).
fof(f187,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f71]) ).
fof(f193,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f46]) ).
fof(f194,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(cnf_transformation,[],[f112]) ).
fof(f198,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(cnf_transformation,[],[f117]) ).
fof(f200,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f53]) ).
fof(f207,plain,
! [X2,X3,X0,X1] :
( contains_pq(i(triple(X0,X1,X2)),X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f135]) ).
fof(f210,plain,
! [X2,X0,X1] :
( ~ phi(triple(X0,X1,X2))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f211,plain,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f137]) ).
fof(f212,plain,
~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f137]) ).
fof(f216,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(definition_unfolding,[],[f198,f200]) ).
fof(f218,plain,
~ contains_pq(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(definition_unfolding,[],[f212,f200]) ).
cnf(c_96,plain,
( ~ contains_slb(X0,X1)
| contains_cpq(triple(X2,X0,X3),X1) ),
inference(cnf_transformation,[],[f186]) ).
cnf(c_98,plain,
~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f187]) ).
cnf(c_104,plain,
findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f193]) ).
cnf(c_105,plain,
( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2))
| X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(cnf_transformation,[],[f194]) ).
cnf(c_109,plain,
( removemin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| X1 = create_slb ),
inference(cnf_transformation,[],[f216]) ).
cnf(c_117,plain,
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_pq(i(triple(X0,X1,X2)),X3) ),
inference(cnf_transformation,[],[f207]) ).
cnf(c_119,plain,
( ~ phi(triple(X0,X1,X2))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f210]) ).
cnf(c_120,negated_conjecture,
~ contains_pq(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f218]) ).
cnf(c_121,negated_conjecture,
phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
inference(cnf_transformation,[],[f211]) ).
cnf(c_4612,plain,
~ contains_cpq(triple(sK2,sK3,sK4),removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(superposition,[status(thm)],[c_117,c_120]) ).
cnf(c_4705,plain,
~ contains_slb(sK3,removemin_cpq_res(triple(sK2,sK3,sK4))),
inference(superposition,[status(thm)],[c_96,c_4612]) ).
cnf(c_4707,plain,
( ~ contains_slb(sK3,findmin_pqp_res(sK2))
| create_slb = sK3 ),
inference(superposition,[status(thm)],[c_109,c_4705]) ).
cnf(c_6157,plain,
( triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad) = findmin_cpq_eff(triple(sK2,sK3,X0))
| create_slb = sK3 ),
inference(superposition,[status(thm)],[c_105,c_4707]) ).
cnf(c_6451,plain,
( ~ phi(findmin_cpq_eff(triple(sK2,sK3,X0)))
| create_slb = sK3
| ok(triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad)) ),
inference(superposition,[status(thm)],[c_6157,c_119]) ).
cnf(c_6464,plain,
( findmin_cpq_eff(triple(sK2,sK3,X0)) = findmin_cpq_eff(triple(sK2,sK3,X1))
| create_slb = sK3 ),
inference(superposition,[status(thm)],[c_6157,c_6157]) ).
cnf(c_6488,plain,
( ~ phi(findmin_cpq_eff(triple(sK2,sK3,X0)))
| create_slb = sK3 ),
inference(forward_subsumption_resolution,[status(thm)],[c_6451,c_98]) ).
cnf(c_6633,plain,
( create_slb = sK3
| phi(findmin_cpq_eff(triple(sK2,sK3,X0))) ),
inference(superposition,[status(thm)],[c_6464,c_121]) ).
cnf(c_6685,plain,
create_slb = sK3,
inference(global_subsumption_just,[status(thm)],[c_6633,c_6488,c_6633]) ).
cnf(c_6704,plain,
phi(findmin_cpq_eff(triple(sK2,create_slb,sK4))),
inference(demodulation,[status(thm)],[c_121,c_6685]) ).
cnf(c_6705,plain,
phi(triple(sK2,create_slb,bad)),
inference(demodulation,[status(thm)],[c_6704,c_104]) ).
cnf(c_6706,plain,
ok(triple(sK2,create_slb,bad)),
inference(superposition,[status(thm)],[c_6705,c_119]) ).
cnf(c_6707,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6706,c_98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV372+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 29 03:11:35 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.00/1.18 % SZS status Started for theBenchmark.p
% 4.00/1.18 % SZS status Theorem for theBenchmark.p
% 4.00/1.18
% 4.00/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.00/1.18
% 4.00/1.18 ------ iProver source info
% 4.00/1.18
% 4.00/1.18 git: date: 2023-05-31 18:12:56 +0000
% 4.00/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.00/1.18 git: non_committed_changes: false
% 4.00/1.18 git: last_make_outside_of_git: false
% 4.00/1.18
% 4.00/1.18 ------ Parsing...
% 4.00/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.00/1.18
% 4.00/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 4.00/1.18
% 4.00/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.00/1.18
% 4.00/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.00/1.18 ------ Proving...
% 4.00/1.18 ------ Problem Properties
% 4.00/1.18
% 4.00/1.18
% 4.00/1.18 clauses 70
% 4.00/1.18 conjectures 2
% 4.00/1.18 EPR 9
% 4.00/1.18 Horn 53
% 4.00/1.18 unary 25
% 4.00/1.18 binary 26
% 4.00/1.18 lits 136
% 4.00/1.18 lits eq 40
% 4.00/1.18 fd_pure 0
% 4.00/1.18 fd_pseudo 0
% 4.00/1.18 fd_cond 5
% 4.00/1.18 fd_pseudo_cond 7
% 4.00/1.18 AC symbols 0
% 4.00/1.18
% 4.00/1.18 ------ Schedule dynamic 5 is on
% 4.00/1.18
% 4.00/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.00/1.18
% 4.00/1.18
% 4.00/1.18 ------
% 4.00/1.18 Current options:
% 4.00/1.18 ------
% 4.00/1.18
% 4.00/1.18
% 4.00/1.18
% 4.00/1.18
% 4.00/1.18 ------ Proving...
% 4.00/1.18
% 4.00/1.18
% 4.00/1.18 % SZS status Theorem for theBenchmark.p
% 4.00/1.18
% 4.00/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.00/1.18
% 4.00/1.19
%------------------------------------------------------------------------------