TSTP Solution File: SWV378+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV378+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:47 EDT 2023
% Result : Theorem 0.45s 1.16s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 13 unt; 0 def)
% Number of atoms : 129 ( 38 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 119 ( 48 ~; 53 |; 8 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 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 : 169 ( 21 sgn; 83 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> bad = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax41) ).
fof(f31,axiom,
! [X0,X1,X2,X3] :
( ~ contains_slb(X1,X3)
=> triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax43) ).
fof(f32,axiom,
! [X0,X1,X2,X3] :
( ( less_than(lookup_slb(X1,X3),X3)
& contains_slb(X1,X3) )
=> remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax44) ).
fof(f33,axiom,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X3,lookup_slb(X1,X3))
& contains_slb(X1,X3) )
=> remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(f42,conjecture,
! [X0,X1,X2,X3] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l14_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
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(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(f70,plain,
! [X0,X1,X2,X3] :
( triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f31]) ).
fof(f71,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ less_than(lookup_slb(X1,X3),X3)
| ~ contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f32]) ).
fof(f72,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ less_than(lookup_slb(X1,X3),X3)
| ~ contains_slb(X1,X3) ),
inference(flattening,[],[f71]) ).
fof(f73,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ strictly_less_than(X3,lookup_slb(X1,X3))
| ~ contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f33]) ).
fof(f74,plain,
! [X0,X1,X2,X3] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ strictly_less_than(X3,lookup_slb(X1,X3))
| ~ contains_slb(X1,X3) ),
inference(flattening,[],[f73]) ).
fof(f82,plain,
? [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
& ~ ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
( ? [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
& ~ ok(triple(X0,X1,X2)) )
=> ( ok(remove_cpq(triple(sK0,sK1,sK2),sK3))
& ~ ok(triple(sK0,sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
( ok(remove_cpq(triple(sK0,sK1,sK2),sK3))
& ~ ok(triple(sK0,sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[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(f128,plain,
! [X2,X3,X0,X1] :
( triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f70]) ).
fof(f129,plain,
! [X2,X3,X0,X1] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),X2)
| ~ less_than(lookup_slb(X1,X3),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f72]) ).
fof(f130,plain,
! [X2,X3,X0,X1] :
( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
| ~ strictly_less_than(X3,lookup_slb(X1,X3))
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f74]) ).
fof(f139,plain,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f90]) ).
fof(f140,plain,
ok(remove_cpq(triple(sK0,sK1,sK2),sK3)),
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_86,plain,
( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_87,plain,
( ~ less_than(lookup_slb(X0,X1),X1)
| ~ contains_slb(X0,X1)
| triple(remove_pqp(X2,X1),remove_slb(X0,X1),X3) = remove_cpq(triple(X2,X0,X3),X1) ),
inference(cnf_transformation,[],[f129]) ).
cnf(c_88,plain,
( ~ strictly_less_than(X0,lookup_slb(X1,X0))
| ~ contains_slb(X1,X0)
| triple(remove_pqp(X2,X0),remove_slb(X1,X0),bad) = remove_cpq(triple(X2,X1,X3),X0) ),
inference(cnf_transformation,[],[f130]) ).
cnf(c_95,negated_conjecture,
ok(remove_cpq(triple(sK0,sK1,sK2),sK3)),
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_406,plain,
( lookup_slb(X0,X1) != X2
| X1 != X3
| ~ contains_slb(X0,X1)
| triple(remove_pqp(X4,X1),remove_slb(X0,X1),bad) = remove_cpq(triple(X4,X0,X5),X1)
| less_than(X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_88,c_131]) ).
cnf(c_407,plain,
( ~ contains_slb(X0,X1)
| triple(remove_pqp(X2,X1),remove_slb(X0,X1),bad) = remove_cpq(triple(X2,X0,X3),X1)
| less_than(lookup_slb(X0,X1),X1) ),
inference(unflattening,[status(thm)],[c_406]) ).
cnf(c_1203,plain,
bad = sK2,
inference(superposition,[status(thm)],[c_84,c_96]) ).
cnf(c_1204,plain,
~ ok(triple(X0,X1,sK2)),
inference(superposition,[status(thm)],[c_1203,c_83]) ).
cnf(c_1207,plain,
( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,sK2)
| contains_slb(X1,X3) ),
inference(demodulation,[status(thm)],[c_86,c_1203]) ).
cnf(c_1221,plain,
( ~ contains_slb(X0,X1)
| triple(remove_pqp(X2,X1),remove_slb(X0,X1),sK2) = remove_cpq(triple(X2,X0,X3),X1)
| less_than(lookup_slb(X0,X1),X1) ),
inference(demodulation,[status(thm)],[c_407,c_1203]) ).
cnf(c_1224,plain,
( ~ contains_slb(X0,X1)
| triple(remove_pqp(X2,X1),remove_slb(X0,X1),X3) = remove_cpq(triple(X2,X0,X3),X1)
| triple(remove_pqp(X4,X1),remove_slb(X0,X1),sK2) = remove_cpq(triple(X4,X0,X5),X1) ),
inference(superposition,[status(thm)],[c_1221,c_87]) ).
cnf(c_1275,plain,
( triple(remove_pqp(X0,X1),remove_slb(X2,X1),X3) = remove_cpq(triple(X0,X2,X3),X1)
| triple(remove_pqp(X4,X1),remove_slb(X2,X1),sK2) = remove_cpq(triple(X4,X2,X5),X1)
| remove_cpq(triple(X6,X2,X7),X1) = triple(X6,X2,sK2) ),
inference(superposition,[status(thm)],[c_1207,c_1224]) ).
cnf(c_1293,plain,
( triple(remove_pqp(X0,sK3),remove_slb(sK1,sK3),X1) = remove_cpq(triple(X0,sK1,X1),sK3)
| triple(remove_pqp(X2,sK3),remove_slb(sK1,sK3),sK2) = remove_cpq(triple(X2,sK1,X3),sK3)
| ok(triple(sK0,sK1,sK2)) ),
inference(superposition,[status(thm)],[c_1275,c_95]) ).
cnf(c_1330,plain,
( triple(remove_pqp(X2,sK3),remove_slb(sK1,sK3),sK2) = remove_cpq(triple(X2,sK1,X3),sK3)
| triple(remove_pqp(X0,sK3),remove_slb(sK1,sK3),X1) = remove_cpq(triple(X0,sK1,X1),sK3) ),
inference(global_subsumption_just,[status(thm)],[c_1293,c_96,c_1293]) ).
cnf(c_1331,plain,
( triple(remove_pqp(X0,sK3),remove_slb(sK1,sK3),X1) = remove_cpq(triple(X0,sK1,X1),sK3)
| triple(remove_pqp(X2,sK3),remove_slb(sK1,sK3),sK2) = remove_cpq(triple(X2,sK1,X3),sK3) ),
inference(renaming,[status(thm)],[c_1330]) ).
cnf(c_1495,plain,
( ~ ok(remove_cpq(triple(X0,sK1,X1),sK3))
| triple(remove_pqp(X2,sK3),remove_slb(sK1,sK3),X3) = remove_cpq(triple(X2,sK1,X3),sK3) ),
inference(superposition,[status(thm)],[c_1331,c_1204]) ).
cnf(c_1667,plain,
triple(remove_pqp(X0,sK3),remove_slb(sK1,sK3),X1) = remove_cpq(triple(X0,sK1,X1),sK3),
inference(superposition,[status(thm)],[c_95,c_1495]) ).
cnf(c_1680,plain,
~ ok(remove_cpq(triple(X0,sK1,sK2),sK3)),
inference(superposition,[status(thm)],[c_1667,c_1204]) ).
cnf(c_1715,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_95,c_1680]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV378+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.34 % CPULimit : 300
% 0.20/0.34 % WCLimit : 300
% 0.20/0.34 % DateTime : Tue Aug 29 08:23:44 EDT 2023
% 0.20/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.45/1.16 % SZS status Started for theBenchmark.p
% 0.45/1.16 % SZS status Theorem for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.16
% 0.45/1.16 ------ iProver source info
% 0.45/1.16
% 0.45/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.16 git: non_committed_changes: false
% 0.45/1.16 git: last_make_outside_of_git: false
% 0.45/1.16
% 0.45/1.16 ------ Parsing...
% 0.45/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.16
% 0.45/1.16 ------ 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
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.16
% 0.45/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.16 ------ Proving...
% 0.45/1.16 ------ Problem Properties
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 clauses 41
% 0.45/1.16 conjectures 2
% 0.45/1.16 EPR 6
% 0.45/1.16 Horn 27
% 0.45/1.16 unary 17
% 0.45/1.16 binary 12
% 0.45/1.16 lits 78
% 0.45/1.16 lits eq 28
% 0.45/1.16 fd_pure 0
% 0.45/1.16 fd_pseudo 0
% 0.45/1.16 fd_cond 5
% 0.45/1.16 fd_pseudo_cond 5
% 0.45/1.16 AC symbols 0
% 0.45/1.16
% 0.45/1.16 ------ Input Options Time Limit: Unbounded
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------
% 0.45/1.16 Current options:
% 0.45/1.16 ------
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 ------ Proving...
% 0.45/1.16
% 0.45/1.16
% 0.45/1.16 % SZS status Theorem for theBenchmark.p
% 0.45/1.16
% 0.45/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.16
% 0.92/1.17
%------------------------------------------------------------------------------