TSTP Solution File: SWV379+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV379+1 : TPTP v8.1.2. Released 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:14:17 EDT 2024
% Result : Theorem 7.30s 1.62s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 65 ( 18 unt; 0 def)
% Number of atoms : 159 ( 65 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 147 ( 53 ~; 65 |; 16 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 145 ( 17 sgn 89 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> bad = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax41) ).
fof(f34,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(f35,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(f36,axiom,
! [X0,X1,X2,X3] :
( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
& 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',ax48) ).
fof(f37,axiom,
! [X0,X1,X2,X3] :
( ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
& 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)),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f42,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l15_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[],[f42]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f46]) ).
fof(f48,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,[],[f35]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
& 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,[],[f36]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
& 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)),X2) ),
inference(rectify,[],[f37]) ).
fof(f52,plain,
! [X0,X1] :
( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f55,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f56,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(flattening,[],[f55]) ).
fof(f69,plain,
! [X0,X1,X2] :
( bad = X2
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f75,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,[],[f48]) ).
fof(f76,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,[],[f75]) ).
fof(f77,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f78,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(ennf_transformation,[],[f50]) ).
fof(f80,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(flattening,[],[f79]) ).
fof(f82,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
( ? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ ok(triple(X0,X1,X2)) )
=> ( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ ok(triple(sK0,sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ ok(triple(sK0,sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f82,f89]) ).
fof(f92,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f94,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f125,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f126,plain,
! [X2,X0,X1] :
( bad = X2
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f69]) ).
fof(f131,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f132,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,[],[f76]) ).
fof(f133,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(cnf_transformation,[],[f78]) ).
fof(f134,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(cnf_transformation,[],[f80]) ).
fof(f139,plain,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f90]) ).
fof(f140,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f90]) ).
cnf(c_50,plain,
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f92]) ).
cnf(c_52,plain,
( ~ less_than(X0,X1)
| less_than(X1,X0)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_83,plain,
~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f125]) ).
cnf(c_84,plain,
( X0 = bad
| ok(triple(X1,X2,X0)) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_89,plain,
findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f131]) ).
cnf(c_90,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,[],[f132]) ).
cnf(c_91,plain,
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2))
| X1 = create_slb ),
inference(cnf_transformation,[],[f133]) ).
cnf(c_92,plain,
( ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ contains_slb(X0,findmin_pqp_res(X1))
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2) = findmin_cpq_eff(triple(X1,X0,X2))
| X0 = create_slb ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_95,negated_conjecture,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f140]) ).
cnf(c_96,negated_conjecture,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f139]) ).
cnf(c_130,plain,
( less_than(X1,X0)
| strictly_less_than(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_50,c_52]) ).
cnf(c_131,plain,
( less_than(X0,X1)
| strictly_less_than(X1,X0) ),
inference(renaming,[status(thm)],[c_130]) ).
cnf(c_132,plain,
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2))
| X1 = create_slb ),
inference(global_subsumption_just,[status(thm)],[c_91,c_90,c_91]) ).
cnf(c_417,plain,
( lookup_slb(X0,findmin_pqp_res(X1)) != X2
| findmin_pqp_res(X1) != X3
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X4))
| X0 = create_slb
| less_than(X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_132,c_131]) ).
cnf(c_418,plain,
( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2))
| X1 = create_slb
| less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(unflattening,[status(thm)],[c_417]) ).
cnf(c_1199,plain,
bad = sK2,
inference(superposition,[status(thm)],[c_84,c_96]) ).
cnf(c_1200,plain,
~ ok(triple(sK0,sK1,bad)),
inference(superposition,[status(thm)],[c_1199,c_96]) ).
cnf(c_1201,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,bad))),
inference(superposition,[status(thm)],[c_1199,c_95]) ).
cnf(c_1215,plain,
( ~ contains_slb(X0,findmin_pqp_res(X1))
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2) = findmin_cpq_eff(triple(X1,X0,X2))
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3))
| X0 = create_slb ),
inference(superposition,[status(thm)],[c_418,c_92]) ).
cnf(c_1224,plain,
( triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) = findmin_cpq_eff(triple(X0,X1,X2))
| triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X3))
| X1 = create_slb ),
inference(forward_subsumption_resolution,[status(thm)],[c_1215,c_90]) ).
cnf(c_1281,plain,
( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| triple(X0,update_slb(X1,findmin_pqp_res(X0)),X3) = findmin_cpq_eff(triple(X0,X1,X3))
| X1 = create_slb ),
inference(superposition,[status(thm)],[c_1224,c_83]) ).
cnf(c_1392,plain,
( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X0) = findmin_cpq_eff(triple(sK0,sK1,X0))
| create_slb = sK1 ),
inference(superposition,[status(thm)],[c_95,c_1281]) ).
cnf(c_1439,plain,
( ~ ok(findmin_cpq_eff(triple(sK0,sK1,bad)))
| create_slb = sK1 ),
inference(superposition,[status(thm)],[c_1392,c_83]) ).
cnf(c_1443,plain,
create_slb = sK1,
inference(global_subsumption_just,[status(thm)],[c_1439,c_1201,c_1439]) ).
cnf(c_1455,plain,
findmin_cpq_eff(triple(X0,sK1,X1)) = triple(X0,sK1,bad),
inference(superposition,[status(thm)],[c_1443,c_89]) ).
cnf(c_1461,plain,
ok(triple(sK0,sK1,bad)),
inference(superposition,[status(thm)],[c_1455,c_95]) ).
cnf(c_1464,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1461,c_1200]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV379+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n029.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri May 3 00:34:07 EDT 2024
% 0.12/0.32 % 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
% 7.30/1.62 % SZS status Started for theBenchmark.p
% 7.30/1.62 % SZS status Theorem for theBenchmark.p
% 7.30/1.62
% 7.30/1.62 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.30/1.62
% 7.30/1.62 ------ iProver source info
% 7.30/1.62
% 7.30/1.62 git: date: 2024-05-02 19:28:25 +0000
% 7.30/1.62 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.30/1.62 git: non_committed_changes: false
% 7.30/1.62
% 7.30/1.62 ------ Parsing...
% 7.30/1.62 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.30/1.62
% 7.30/1.62 ------ Preprocessing... sup_sim: 0 sf_s rm: 7 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
% 7.30/1.62
% 7.30/1.62 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.30/1.62
% 7.30/1.62 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.30/1.62 ------ Proving...
% 7.30/1.62 ------ Problem Properties
% 7.30/1.62
% 7.30/1.62
% 7.30/1.62 clauses 41
% 7.30/1.62 conjectures 2
% 7.30/1.62 EPR 6
% 7.30/1.62 Horn 27
% 7.30/1.62 unary 17
% 7.30/1.62 binary 12
% 7.30/1.62 lits 78
% 7.30/1.62 lits eq 28
% 7.30/1.62 fd_pure 0
% 7.30/1.62 fd_pseudo 0
% 7.30/1.62 fd_cond 5
% 7.30/1.62 fd_pseudo_cond 5
% 7.30/1.62 AC symbols 0
% 7.30/1.62
% 7.30/1.62 ------ Input Options Time Limit: Unbounded
% 7.30/1.62
% 7.30/1.62
% 7.30/1.62 ------
% 7.30/1.62 Current options:
% 7.30/1.62 ------
% 7.30/1.62
% 7.30/1.62
% 7.30/1.62
% 7.30/1.62
% 7.30/1.62 ------ Proving...
% 7.30/1.62
% 7.30/1.62
% 7.30/1.62 % SZS status Theorem for theBenchmark.p
% 7.30/1.62
% 7.30/1.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.30/1.62
% 7.30/1.63
%------------------------------------------------------------------------------