TSTP Solution File: SYN000+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN000+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:04:36 EDT 2023
% Result : Theorem 0.77s 1.18s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 101 ( 40 ~; 37 |; 18 &)
% ( 2 <=>; 2 =>; 0 <=; 2 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 35 ( 2 sgn; 18 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ( ~ q(X0,a)
=> p(X0) )
<=> ? [X1,X2] :
( r(X0,f(X1),g(X0,f(X1),X2))
<~> ~ s(f(f(f(b)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',useful_connectives) ).
fof(f8,axiom,
p(h),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',role_hypothesis) ).
fof(f9,conjecture,
? [X0] : p(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',role_conjecture) ).
fof(f10,negated_conjecture,
~ ? [X0] : p(X0),
inference(negated_conjecture,[],[f9]) ).
fof(f22,plain,
! [X0] :
( ( p(X0)
| q(X0,a) )
<=> ? [X1,X2] :
( r(X0,f(X1),g(X0,f(X1),X2))
<~> ~ s(f(f(f(b)))) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f24,plain,
! [X0] : ~ p(X0),
inference(ennf_transformation,[],[f10]) ).
fof(f29,plain,
! [X0] :
( ( p(X0)
| q(X0,a)
| ! [X1,X2] :
( ( r(X0,f(X1),g(X0,f(X1),X2))
| s(f(f(f(b)))) )
& ( ~ s(f(f(f(b))))
| ~ r(X0,f(X1),g(X0,f(X1),X2)) ) ) )
& ( ? [X1,X2] :
( ( s(f(f(f(b))))
| ~ r(X0,f(X1),g(X0,f(X1),X2)) )
& ( ~ s(f(f(f(b))))
| r(X0,f(X1),g(X0,f(X1),X2)) ) )
| ( ~ p(X0)
& ~ q(X0,a) ) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f30,plain,
! [X0] :
( ( p(X0)
| q(X0,a)
| ! [X1,X2] :
( ( r(X0,f(X1),g(X0,f(X1),X2))
| s(f(f(f(b)))) )
& ( ~ s(f(f(f(b))))
| ~ r(X0,f(X1),g(X0,f(X1),X2)) ) ) )
& ( ? [X1,X2] :
( ( s(f(f(f(b))))
| ~ r(X0,f(X1),g(X0,f(X1),X2)) )
& ( ~ s(f(f(f(b))))
| r(X0,f(X1),g(X0,f(X1),X2)) ) )
| ( ~ p(X0)
& ~ q(X0,a) ) ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ( p(X0)
| q(X0,a)
| ! [X1,X2] :
( ( r(X0,f(X1),g(X0,f(X1),X2))
| s(f(f(f(b)))) )
& ( ~ s(f(f(f(b))))
| ~ r(X0,f(X1),g(X0,f(X1),X2)) ) ) )
& ( ? [X3,X4] :
( ( s(f(f(f(b))))
| ~ r(X0,f(X3),g(X0,f(X3),X4)) )
& ( ~ s(f(f(f(b))))
| r(X0,f(X3),g(X0,f(X3),X4)) ) )
| ( ~ p(X0)
& ~ q(X0,a) ) ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0] :
( ? [X3,X4] :
( ( s(f(f(f(b))))
| ~ r(X0,f(X3),g(X0,f(X3),X4)) )
& ( ~ s(f(f(f(b))))
| r(X0,f(X3),g(X0,f(X3),X4)) ) )
=> ( ( s(f(f(f(b))))
| ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) )
& ( ~ s(f(f(f(b))))
| r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0] :
( ( p(X0)
| q(X0,a)
| ! [X1,X2] :
( ( r(X0,f(X1),g(X0,f(X1),X2))
| s(f(f(f(b)))) )
& ( ~ s(f(f(f(b))))
| ~ r(X0,f(X1),g(X0,f(X1),X2)) ) ) )
& ( ( ( s(f(f(f(b))))
| ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) )
& ( ~ s(f(f(f(b))))
| r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) ) )
| ( ~ p(X0)
& ~ q(X0,a) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f31,f32]) ).
fof(f44,plain,
! [X0] :
( s(f(f(f(b))))
| ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0)))
| ~ p(X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f51,plain,
p(h),
inference(cnf_transformation,[],[f8]) ).
fof(f52,plain,
! [X0] : ~ p(X0),
inference(cnf_transformation,[],[f24]) ).
cnf(c_56,plain,
( ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0)))
| ~ p(X0)
| s(f(f(f(b)))) ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_64,plain,
p(h),
inference(cnf_transformation,[],[f51]) ).
cnf(c_65,negated_conjecture,
~ p(X0),
inference(cnf_transformation,[],[f52]) ).
cnf(c_88,plain,
~ p(X0),
inference(global_subsumption_just,[status(thm)],[c_56,c_65]) ).
cnf(c_96,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_64,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN000+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 21:22:05 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.77/1.18 % SZS status Started for theBenchmark.p
% 0.77/1.18 % SZS status Theorem for theBenchmark.p
% 0.77/1.18
% 0.77/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.77/1.18
% 0.77/1.18 ------ iProver source info
% 0.77/1.18
% 0.77/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.77/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.77/1.18 git: non_committed_changes: false
% 0.77/1.18 git: last_make_outside_of_git: false
% 0.77/1.18
% 0.77/1.18 ------ Parsing...
% 0.77/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.77/1.18
% 0.77/1.18 ------ Preprocessing...
% 0.77/1.18
% 0.77/1.18 % SZS status Theorem for theBenchmark.p
% 0.77/1.18
% 0.77/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.77/1.18
% 0.77/1.18
%------------------------------------------------------------------------------