TSTP Solution File: SWV376+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV376+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:46 EDT 2023
% Result : Theorem 3.13s 1.15s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 16 unt; 0 def)
% Number of atoms : 114 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 124 ( 53 ~; 34 |; 22 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 148 ( 4 sgn; 86 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
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(f42,axiom,
( ! [X0,X1,X2,X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ ok(triple(X3,X4,X5))
=> ~ ok(im_succ_cpq(triple(X3,X4,X5))) ) )
=> ! [X6,X7,X8] :
( ~ ok(triple(X6,X7,X8))
=> ! [X9,X10,X11] :
( succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11))
=> ~ ok(triple(X9,X10,X11)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_induction) ).
fof(f43,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_l13) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ~ ok(triple(X3,X4,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ~ ok(triple(X3,X4,X5)) ) ),
inference(negated_conjecture,[],[f44]) ).
fof(f48,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f49,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f48]) ).
fof(f71,plain,
! [X0,X1,X2] :
( bad = X2
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f84,plain,
( ! [X6,X7,X8] :
( ! [X9,X10,X11] :
( ~ ok(triple(X9,X10,X11))
| ~ succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) )
| ok(triple(X6,X7,X8)) )
| ? [X0,X1,X2,X3,X4,X5] :
( ok(im_succ_cpq(triple(X3,X4,X5)))
& ~ ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f85,plain,
( ! [X6,X7,X8] :
( ! [X9,X10,X11] :
( ~ ok(triple(X9,X10,X11))
| ~ succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) )
| ok(triple(X6,X7,X8)) )
| ? [X0,X1,X2,X3,X4,X5] :
( ok(im_succ_cpq(triple(X3,X4,X5)))
& ~ ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ) ),
inference(flattening,[],[f84]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f43]) ).
fof(f87,plain,
? [X0,X1,X2] :
( ? [X3,X4,X5] :
( ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ~ ok(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f45]) ).
fof(f94,plain,
( ! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ok(triple(X0,X1,X2)) )
| ? [X6,X7,X8,X9,X10,X11] :
( ok(im_succ_cpq(triple(X9,X10,X11)))
& ~ ok(triple(X9,X10,X11))
& succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) ) ),
inference(rectify,[],[f85]) ).
fof(f95,plain,
( ? [X6,X7,X8,X9,X10,X11] :
( ok(im_succ_cpq(triple(X9,X10,X11)))
& ~ ok(triple(X9,X10,X11))
& succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11)) )
=> ( ok(im_succ_cpq(triple(sK3,sK4,sK5)))
& ~ ok(triple(sK3,sK4,sK5))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)) ) ),
introduced(choice_axiom,[]) ).
fof(f96,plain,
( ! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ok(triple(X0,X1,X2)) )
| ( ok(im_succ_cpq(triple(sK3,sK4,sK5)))
& ~ ok(triple(sK3,sK4,sK5))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f94,f95]) ).
fof(f97,plain,
( ? [X0,X1,X2] :
( ? [X3,X4,X5] :
( ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ~ ok(triple(X0,X1,X2)) )
=> ( ? [X5,X4,X3] :
( ok(triple(X3,X4,X5))
& succ_cpq(triple(sK6,sK7,sK8),triple(X3,X4,X5)) )
& ~ ok(triple(sK6,sK7,sK8)) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
( ? [X5,X4,X3] :
( ok(triple(X3,X4,X5))
& succ_cpq(triple(sK6,sK7,sK8),triple(X3,X4,X5)) )
=> ( ok(triple(sK9,sK10,sK11))
& succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
( ok(triple(sK9,sK10,sK11))
& succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11))
& ~ ok(triple(sK6,sK7,sK8)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11])],[f87,f98,f97]) ).
fof(f134,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f49]) ).
fof(f135,plain,
! [X2,X0,X1] :
( bad = X2
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f71]) ).
fof(f149,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ok(triple(X0,X1,X2))
| ~ ok(triple(sK3,sK4,sK5)) ),
inference(cnf_transformation,[],[f96]) ).
fof(f150,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ok(triple(X0,X1,X2))
| ok(im_succ_cpq(triple(sK3,sK4,sK5))) ),
inference(cnf_transformation,[],[f96]) ).
fof(f151,plain,
! [X2,X0,X1] :
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f152,plain,
~ ok(triple(sK6,sK7,sK8)),
inference(cnf_transformation,[],[f99]) ).
fof(f153,plain,
succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f99]) ).
fof(f154,plain,
ok(triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f99]) ).
cnf(c_83,plain,
~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f134]) ).
cnf(c_84,plain,
( X0 = bad
| ok(triple(X1,X2,X0)) ),
inference(cnf_transformation,[],[f135]) ).
cnf(c_95,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f150]) ).
cnf(c_96,plain,
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ ok(triple(sK3,sK4,sK5))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_98,plain,
( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ok(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_99,negated_conjecture,
ok(triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f154]) ).
cnf(c_100,negated_conjecture,
succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f153]) ).
cnf(c_101,negated_conjecture,
~ ok(triple(sK6,sK7,sK8)),
inference(cnf_transformation,[],[f152]) ).
cnf(c_1713,plain,
bad = sK8,
inference(superposition,[status(thm)],[c_84,c_101]) ).
cnf(c_1716,plain,
succ_cpq(triple(sK6,sK7,bad),triple(sK9,sK10,sK11)),
inference(demodulation,[status(thm)],[c_100,c_1713]) ).
cnf(c_2749,plain,
( ~ ok(triple(sK9,sK10,sK11))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ok(triple(sK6,sK7,bad)) ),
inference(superposition,[status(thm)],[c_1716,c_95]) ).
cnf(c_2753,plain,
ok(im_succ_cpq(triple(sK3,sK4,sK5))),
inference(forward_subsumption_resolution,[status(thm)],[c_2749,c_83,c_99]) ).
cnf(c_2763,plain,
( ~ ok(triple(sK3,sK4,sK5))
| ~ ok(triple(sK9,sK10,sK11))
| ok(triple(sK6,sK7,bad)) ),
inference(superposition,[status(thm)],[c_1716,c_96]) ).
cnf(c_2767,plain,
~ ok(triple(sK3,sK4,sK5)),
inference(forward_subsumption_resolution,[status(thm)],[c_2763,c_83,c_99]) ).
cnf(c_2768,plain,
ok(triple(sK3,sK4,sK5)),
inference(superposition,[status(thm)],[c_2753,c_98]) ).
cnf(c_2769,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2768,c_2767]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV376+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n015.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.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 09:07:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.13/1.15 % SZS status Started for theBenchmark.p
% 3.13/1.15 % SZS status Theorem for theBenchmark.p
% 3.13/1.15
% 3.13/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.13/1.15
% 3.13/1.15 ------ iProver source info
% 3.13/1.15
% 3.13/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.13/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.13/1.15 git: non_committed_changes: false
% 3.13/1.15 git: last_make_outside_of_git: false
% 3.13/1.15
% 3.13/1.15 ------ Parsing...
% 3.13/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.13/1.15
% 3.13/1.15 ------ 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: 3 0s sf_e pe_s pe_e
% 3.13/1.15
% 3.13/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.13/1.15
% 3.13/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.13/1.15 ------ Proving...
% 3.13/1.15 ------ Problem Properties
% 3.13/1.15
% 3.13/1.15
% 3.13/1.15 clauses 51
% 3.13/1.15 conjectures 3
% 3.13/1.15 EPR 7
% 3.13/1.15 Horn 35
% 3.13/1.15 unary 19
% 3.13/1.15 binary 17
% 3.13/1.15 lits 102
% 3.13/1.15 lits eq 28
% 3.13/1.15 fd_pure 0
% 3.13/1.15 fd_pseudo 0
% 3.13/1.15 fd_cond 5
% 3.13/1.15 fd_pseudo_cond 5
% 3.13/1.15 AC symbols 0
% 3.13/1.15
% 3.13/1.15 ------ Schedule dynamic 5 is on
% 3.13/1.15
% 3.13/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.13/1.15
% 3.13/1.15
% 3.13/1.15 ------
% 3.13/1.15 Current options:
% 3.13/1.15 ------
% 3.13/1.15
% 3.13/1.15
% 3.13/1.15
% 3.13/1.15
% 3.13/1.15 ------ Proving...
% 3.13/1.15
% 3.13/1.15
% 3.13/1.15 % SZS status Theorem for theBenchmark.p
% 3.13/1.15
% 3.13/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.13/1.16
% 3.13/1.16
%------------------------------------------------------------------------------