TSTP Solution File: SYN980+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN980+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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.79s 1.18s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 83 ( 31 ~; 21 |; 18 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 47 ( 7 sgn; 27 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X1] :
( ( q(f(X0),X0)
=> q(X2,X1) )
& p(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X1] :
( ( q(f(X0),X0)
=> q(X2,X1) )
& p(X2,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X3] :
( ( q(f(X0),X0)
=> q(X2,X3) )
& p(X2,X3) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X0] :
( ! [X2,X3] :
( ( ~ q(X2,X3)
& q(f(X0),X0) )
| ~ p(X2,X3) )
& ! [X1] :
( p(f(X1),X1)
| ( ~ r(X1)
& r(X0) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0] :
( ! [X1,X2] :
( ( ~ q(X1,X2)
& q(f(X0),X0) )
| ~ p(X1,X2) )
& ! [X3] :
( p(f(X3),X3)
| ( ~ r(X3)
& r(X0) ) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
( ! [X1,X2] :
( ( ~ q(X1,X2)
& q(f(X0),X0) )
| ~ p(X1,X2) )
& ! [X3] :
( p(f(X3),X3)
| ( ~ r(X3)
& r(X0) ) ) )
=> ( ! [X2,X1] :
( ( ~ q(X1,X2)
& q(f(sK0),sK0) )
| ~ p(X1,X2) )
& ! [X3] :
( p(f(X3),X3)
| ( ~ r(X3)
& r(sK0) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ! [X1,X2] :
( ( ~ q(X1,X2)
& q(f(sK0),sK0) )
| ~ p(X1,X2) )
& ! [X3] :
( p(f(X3),X3)
| ( ~ r(X3)
& r(sK0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).
fof(f8,plain,
! [X3] :
( p(f(X3),X3)
| r(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X3] :
( p(f(X3),X3)
| ~ r(X3) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X2,X1] :
( q(f(sK0),sK0)
| ~ p(X1,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2,X1] :
( ~ q(X1,X2)
| ~ p(X1,X2) ),
inference(cnf_transformation,[],[f7]) ).
cnf(c_49,negated_conjecture,
( ~ q(X0,X1)
| ~ p(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_50,negated_conjecture,
( ~ p(X0,X1)
| q(f(sK0),sK0) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_51,negated_conjecture,
( ~ r(X0)
| p(f(X0),X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_52,negated_conjecture,
( p(f(X0),X0)
| r(sK0) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_53,plain,
( p(f(sK0),sK0)
| r(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_54,plain,
( ~ r(sK0)
| p(f(sK0),sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_73,plain,
( ~ p(f(sK0),sK0)
| ~ p(X0,X1) ),
inference(resolution,[status(thm)],[c_49,c_50]) ).
cnf(c_75,plain,
~ p(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_73,c_53,c_54,c_73]) ).
cnf(c_82,plain,
r(sK0),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_75]) ).
cnf(c_83,plain,
~ r(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_75]) ).
cnf(c_84,plain,
~ r(sK0),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_85,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_82,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN980+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n018.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 17:32:00 EDT 2023
% 0.13/0.35 % 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.79/1.18 % SZS status Started for theBenchmark.p
% 0.79/1.18 % SZS status Theorem for theBenchmark.p
% 0.79/1.18
% 0.79/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.79/1.18
% 0.79/1.18 ------ iProver source info
% 0.79/1.18
% 0.79/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.79/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.79/1.18 git: non_committed_changes: false
% 0.79/1.18 git: last_make_outside_of_git: false
% 0.79/1.18
% 0.79/1.18 ------ Parsing...
% 0.79/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.79/1.18
% 0.79/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s
% 0.79/1.18
% 0.79/1.18 % SZS status Theorem for theBenchmark.p
% 0.79/1.18
% 0.79/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.79/1.18
% 0.79/1.18
%------------------------------------------------------------------------------