TSTP Solution File: SYN944+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN944+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:33:40 EDT 2024
% Result : Theorem 0.85s 1.22s
% Output : CNFRefutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 130 ( 44 ~; 31 |; 45 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 84 ( 3 sgn 53 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1,X2] :
( ( ! [X3,X4] :
( r(X3,X4)
=> q(X3,X4) )
& ! [X3] :
( s(X3)
=> p(X3) )
& r(X1,X2)
& s(X1)
& s(X0) )
=> ? [X3,X4] :
( q(X3,X4)
& p(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ! [X3,X4] :
( r(X3,X4)
=> q(X3,X4) )
& ! [X3] :
( s(X3)
=> p(X3) )
& r(X1,X2)
& s(X1)
& s(X0) )
=> ? [X3,X4] :
( q(X3,X4)
& p(X3) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ! [X0,X1,X2] :
( ( ! [X3,X4] :
( r(X3,X4)
=> q(X3,X4) )
& ! [X5] :
( s(X5)
=> p(X5) )
& r(X1,X2)
& s(X1)
& s(X0) )
=> ? [X6,X7] :
( q(X6,X7)
& p(X6) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X0,X1,X2] :
( ! [X6,X7] :
( ~ q(X6,X7)
| ~ p(X6) )
& ! [X3,X4] :
( q(X3,X4)
| ~ r(X3,X4) )
& ! [X5] :
( p(X5)
| ~ s(X5) )
& r(X1,X2)
& s(X1)
& s(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0,X1,X2] :
( ! [X6,X7] :
( ~ q(X6,X7)
| ~ p(X6) )
& ! [X3,X4] :
( q(X3,X4)
| ~ r(X3,X4) )
& ! [X5] :
( p(X5)
| ~ s(X5) )
& r(X1,X2)
& s(X1)
& s(X0) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
? [X0,X1,X2] :
( ! [X3,X4] :
( ~ q(X3,X4)
| ~ p(X3) )
& ! [X5,X6] :
( q(X5,X6)
| ~ r(X5,X6) )
& ! [X7] :
( p(X7)
| ~ s(X7) )
& r(X1,X2)
& s(X1)
& s(X0) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0,X1,X2] :
( ! [X3,X4] :
( ~ q(X3,X4)
| ~ p(X3) )
& ! [X5,X6] :
( q(X5,X6)
| ~ r(X5,X6) )
& ! [X7] :
( p(X7)
| ~ s(X7) )
& r(X1,X2)
& s(X1)
& s(X0) )
=> ( ! [X3,X4] :
( ~ q(X3,X4)
| ~ p(X3) )
& ! [X5,X6] :
( q(X5,X6)
| ~ r(X5,X6) )
& ! [X7] :
( p(X7)
| ~ s(X7) )
& r(sK1,sK2)
& s(sK1)
& s(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ! [X3,X4] :
( ~ q(X3,X4)
| ~ p(X3) )
& ! [X5,X6] :
( q(X5,X6)
| ~ r(X5,X6) )
& ! [X7] :
( p(X7)
| ~ s(X7) )
& r(sK1,sK2)
& s(sK1)
& s(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
fof(f10,plain,
s(sK1),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
r(sK1,sK2),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X7] :
( p(X7)
| ~ s(X7) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X6,X5] :
( q(X5,X6)
| ~ r(X5,X6) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X3,X4] :
( ~ q(X3,X4)
| ~ p(X3) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,negated_conjecture,
( ~ q(X0,X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_50,negated_conjecture,
( ~ r(X0,X1)
| q(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_51,negated_conjecture,
( ~ s(X0)
| p(X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_52,negated_conjecture,
r(sK1,sK2),
inference(cnf_transformation,[],[f11]) ).
cnf(c_53,negated_conjecture,
s(sK1),
inference(cnf_transformation,[],[f10]) ).
cnf(c_55,plain,
( ~ s(sK1)
| p(sK1) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_62,negated_conjecture,
( ~ r(X0_13,X0_14)
| q(X0_13,X0_14) ),
inference(subtyping,[status(esa)],[c_50]) ).
cnf(c_63,negated_conjecture,
( ~ q(X0_13,X0_14)
| ~ p(X0_13) ),
inference(subtyping,[status(esa)],[c_49]) ).
cnf(c_64,negated_conjecture,
( ~ q(X0_13,X0_14)
| ~ p(X0_13) ),
inference(demodulation,[status(thm)],[c_63]) ).
cnf(c_65,negated_conjecture,
( ~ r(X0_13,X0_14)
| q(X0_13,X0_14) ),
inference(demodulation,[status(thm)],[c_62]) ).
cnf(c_70,plain,
( ~ r(sK1,sK2)
| q(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_71,plain,
( ~ q(sK1,sK2)
| ~ p(sK1) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_72,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_71,c_70,c_55,c_52,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN944+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 20:55:35 EDT 2024
% 0.14/0.35 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.85/1.22 % SZS status Started for theBenchmark.p
% 0.85/1.22 % SZS status Theorem for theBenchmark.p
% 0.85/1.22
% 0.85/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.85/1.22
% 0.85/1.22 ------ iProver source info
% 0.85/1.22
% 0.85/1.22 git: date: 2024-05-02 19:28:25 +0000
% 0.85/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.85/1.22 git: non_committed_changes: false
% 0.85/1.22
% 0.85/1.22 ------ Parsing...
% 0.85/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.85/1.22
% 0.85/1.22 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.85/1.22 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.85/1.22 ------ Proving...
% 0.85/1.22 ------ Problem Properties
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 clauses 6
% 0.85/1.22 conjectures 6
% 0.85/1.22 EPR 6
% 0.85/1.22 Horn 6
% 0.85/1.22 unary 3
% 0.85/1.22 binary 3
% 0.85/1.22 lits 9
% 0.85/1.22 lits eq 0
% 0.85/1.22 fd_pure 0
% 0.85/1.22 fd_pseudo 0
% 0.85/1.22 fd_cond 0
% 0.85/1.22 fd_pseudo_cond 0
% 0.85/1.22 AC symbols 0
% 0.85/1.22
% 0.85/1.22 ------ Schedule EPR Horn non eq is on
% 0.85/1.22
% 0.85/1.22 ------ no equalities: superposition off
% 0.85/1.22
% 0.85/1.22 ------ Option_epr_horn Time Limit: Unbounded
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 ------
% 0.85/1.22 Current options:
% 0.85/1.22 ------
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 ------ Proving...
% 0.85/1.22
% 0.85/1.22
% 0.85/1.22 % SZS status Theorem for theBenchmark.p
% 0.85/1.22
% 0.85/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.85/1.22
% 0.85/1.22
%------------------------------------------------------------------------------