TSTP Solution File: SYN979+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN979+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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 Sep 1 03:15:02 EDT 2023
% Result : Theorem 0.74s 1.18s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 8 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 24 ( 6 avg)
% Number of connectives : 105 ( 25 ~; 17 |; 54 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 32 ( 6 sgn; 16 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
( ( s(X0)
& ( s(X0)
=> p(X2,X3) )
& r(X1)
& r(X0)
& ( r(X3)
=> p(X1,X3) )
& q(X1)
& q(X0)
& ( q(X2)
=> p(X2,X0) ) )
=> p(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
( ( s(X0)
& ( s(X0)
=> p(X2,X3) )
& r(X1)
& r(X0)
& ( r(X3)
=> p(X1,X3) )
& q(X1)
& q(X0)
& ( q(X2)
=> p(X2,X0) ) )
=> p(X0,X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
( ~ p(X0,X1)
& s(X0)
& ( p(X2,X3)
| ~ s(X0) )
& r(X1)
& r(X0)
& ( p(X1,X3)
| ~ r(X3) )
& q(X1)
& q(X0)
& ( p(X2,X0)
| ~ q(X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
( ~ p(X0,X1)
& s(X0)
& ( p(X2,X3)
| ~ s(X0) )
& r(X1)
& r(X0)
& ( p(X1,X3)
| ~ r(X3) )
& q(X1)
& q(X0)
& ( p(X2,X0)
| ~ q(X2) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
( ? [X0,X1] :
! [X2,X3] :
( ~ p(X0,X1)
& s(X0)
& ( p(X2,X3)
| ~ s(X0) )
& r(X1)
& r(X0)
& ( p(X1,X3)
| ~ r(X3) )
& q(X1)
& q(X0)
& ( p(X2,X0)
| ~ q(X2) ) )
=> ! [X3,X2] :
( ~ p(sK0,sK1)
& s(sK0)
& ( p(X2,X3)
| ~ s(sK0) )
& r(sK1)
& r(sK0)
& ( p(sK1,X3)
| ~ r(X3) )
& q(sK1)
& q(sK0)
& ( p(X2,sK0)
| ~ q(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
! [X2,X3] :
( ~ p(sK0,sK1)
& s(sK0)
& ( p(X2,X3)
| ~ s(sK0) )
& r(sK1)
& r(sK0)
& ( p(sK1,X3)
| ~ r(X3) )
& q(sK1)
& q(sK0)
& ( p(X2,sK0)
| ~ q(X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).
fof(f13,plain,
! [X2,X3] :
( p(X2,X3)
| ~ s(sK0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f14,plain,
s(sK0),
inference(cnf_transformation,[],[f6]) ).
fof(f15,plain,
~ p(sK0,sK1),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,negated_conjecture,
~ p(sK0,sK1),
inference(cnf_transformation,[],[f15]) ).
cnf(c_50,negated_conjecture,
s(sK0),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,negated_conjecture,
( ~ s(sK0)
| p(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_61,negated_conjecture,
p(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_51,c_50,c_51]) ).
cnf(c_64,negated_conjecture,
p(X0_13,X0_14),
inference(subtyping,[status(esa)],[c_61]) ).
cnf(c_66,plain,
p(sK0,sK1),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_67,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_66,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN979+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Sat Aug 26 20:10:47 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.74/1.18 % SZS status Started for theBenchmark.p
% 0.74/1.18 % SZS status Theorem for theBenchmark.p
% 0.74/1.18
% 0.74/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.74/1.18
% 0.74/1.18 ------ iProver source info
% 0.74/1.18
% 0.74/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.74/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.74/1.18 git: non_committed_changes: false
% 0.74/1.18 git: last_make_outside_of_git: false
% 0.74/1.18
% 0.74/1.18 ------ Parsing...
% 0.74/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 ------ Preprocessing... sf_s rm: 7 0s sf_e sf_s rm: 0 0s sf_e
% 0.74/1.18
% 0.74/1.18 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.74/1.18 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.74/1.18 ------ Proving...
% 0.74/1.18 ------ Problem Properties
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 clauses 2
% 0.74/1.18 conjectures 2
% 0.74/1.18 EPR 2
% 0.74/1.18 Horn 2
% 0.74/1.18 unary 2
% 0.74/1.18 binary 0
% 0.74/1.18 lits 2
% 0.74/1.18 lits eq 0
% 0.74/1.18 fd_pure 0
% 0.74/1.18 fd_pseudo 0
% 0.74/1.18 fd_cond 0
% 0.74/1.18 fd_pseudo_cond 0
% 0.74/1.18 AC symbols 0
% 0.74/1.18
% 0.74/1.18 ------ Schedule EPR Horn non eq is on
% 0.74/1.18
% 0.74/1.18 ------ no equalities: superposition off
% 0.74/1.18
% 0.74/1.18 ------ Option_epr_horn Time Limit: Unbounded
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 ------
% 0.74/1.18 Current options:
% 0.74/1.18 ------
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 ------ Proving...
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 % SZS status Theorem for theBenchmark.p
% 0.74/1.18
% 0.74/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.74/1.18
% 0.74/1.18
%------------------------------------------------------------------------------