TSTP Solution File: SYN939+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN939+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:14:51 EDT 2023
% Result : Theorem 0.88s 1.16s
% Output : CNFRefutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 121 ( 51 ~; 42 |; 21 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 53 ( 8 sgn; 29 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
( ! [X2] : q(f(X2))
=> ? [X3,X4] :
( q(X3)
& ( r(X4)
=> ( r(X0)
& r(X1) ) )
& ( p(f(X4))
=> p(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] : q(f(X2))
=> ? [X3,X4] :
( q(X3)
& ( r(X4)
=> ( r(X0)
& r(X1) ) )
& ( p(f(X4))
=> p(X3) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0,X1] :
( ! [X3,X4] :
( ~ q(X3)
| ( ( ~ r(X0)
| ~ r(X1) )
& r(X4) )
| ( ~ p(X3)
& p(f(X4)) ) )
& ! [X2] : q(f(X2)) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ q(X2)
| ( ( ~ r(X0)
| ~ r(X1) )
& r(X3) )
| ( ~ p(X2)
& p(f(X3)) ) )
& ! [X4] : q(f(X4)) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
( ? [X0,X1] :
( ! [X2,X3] :
( ~ q(X2)
| ( ( ~ r(X0)
| ~ r(X1) )
& r(X3) )
| ( ~ p(X2)
& p(f(X3)) ) )
& ! [X4] : q(f(X4)) )
=> ( ! [X3,X2] :
( ~ q(X2)
| ( ( ~ r(sK0)
| ~ r(sK1) )
& r(X3) )
| ( ~ p(X2)
& p(f(X3)) ) )
& ! [X4] : q(f(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X2,X3] :
( ~ q(X2)
| ( ( ~ r(sK0)
| ~ r(sK1) )
& r(X3) )
| ( ~ p(X2)
& p(f(X3)) ) )
& ! [X4] : q(f(X4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).
fof(f7,plain,
! [X4] : q(f(X4)),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X2,X3] :
( ~ q(X2)
| r(X3)
| p(f(X3)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X2,X3] :
( ~ q(X2)
| r(X3)
| ~ p(X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X3] :
( ~ q(X2)
| ~ r(sK0)
| ~ r(sK1)
| p(f(X3)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
! [X2] :
( ~ q(X2)
| ~ r(sK0)
| ~ r(sK1)
| ~ p(X2) ),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,negated_conjecture,
( ~ q(X0)
| ~ p(X0)
| ~ r(sK0)
| ~ r(sK1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_50,negated_conjecture,
( ~ q(X0)
| ~ r(sK0)
| ~ r(sK1)
| p(f(X1)) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_51,negated_conjecture,
( ~ q(X0)
| ~ p(X0)
| r(X1) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_52,negated_conjecture,
( ~ q(X0)
| p(f(X1))
| r(X1) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_53,negated_conjecture,
q(f(X0)),
inference(cnf_transformation,[],[f7]) ).
cnf(c_67,plain,
( ~ q(X0)
| ~ p(X0)
| ~ r(sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_51]) ).
cnf(c_78,plain,
( ~ q(X0)
| ~ p(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_67,c_51]) ).
cnf(c_94,plain,
~ p(f(X0)),
inference(resolution,[status(thm)],[c_78,c_53]) ).
cnf(c_95,plain,
~ p(f(sK0)),
inference(instantiation,[status(thm)],[c_94]) ).
cnf(c_99,plain,
( p(f(X0))
| r(X0) ),
inference(resolution,[status(thm)],[c_52,c_53]) ).
cnf(c_100,plain,
( p(f(sK0))
| r(sK0) ),
inference(instantiation,[status(thm)],[c_99]) ).
cnf(c_101,plain,
r(X0),
inference(global_subsumption_just,[status(thm)],[c_99,c_94,c_99]) ).
cnf(c_107,plain,
( ~ r(sK0)
| ~ r(sK1)
| p(f(X0)) ),
inference(resolution,[status(thm)],[c_50,c_53]) ).
cnf(c_109,plain,
~ r(sK1),
inference(global_subsumption_just,[status(thm)],[c_107,c_94,c_95,c_100,c_107]) ).
cnf(c_112,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_109,c_101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN939+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 21:29:04 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.88/1.16 % SZS status Started for theBenchmark.p
% 0.88/1.16 % SZS status Theorem for theBenchmark.p
% 0.88/1.16
% 0.88/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.88/1.16
% 0.88/1.16 ------ iProver source info
% 0.88/1.16
% 0.88/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.88/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.88/1.16 git: non_committed_changes: false
% 0.88/1.16 git: last_make_outside_of_git: false
% 0.88/1.16
% 0.88/1.16 ------ Parsing...
% 0.88/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.88/1.16
% 0.88/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s
% 0.88/1.16
% 0.88/1.16 % SZS status Theorem for theBenchmark.p
% 0.88/1.16
% 0.88/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.88/1.16
% 0.88/1.16
%------------------------------------------------------------------------------