TSTP Solution File: SYN722+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN722+1 : TPTP v8.1.2. Released v2.5.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 Sep 1 03:09:34 EDT 2023
% Result : Theorem 0.86s 1.17s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 141 ( 67 ~; 57 |; 16 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 26 ( 3 sgn; 15 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
~ ( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(d)
| ~ q(c)
| ~ q(X2)
| ~ q(X1)
| p(X1) )
& ! [X0] :
( q(X0)
& ( r(X0)
| p(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm119) ).
fof(f2,negated_conjecture,
~ ~ ( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(d)
| ~ q(c)
| ~ q(X2)
| ~ q(X1)
| p(X1) )
& ! [X0] :
( q(X0)
& ( r(X0)
| p(X0) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ~ ( ( ~ p(b)
| ~ p(a) )
& ! [X0] :
? [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(X1)
| ~ q(X0)
| p(X0) )
& ! [X2] :
( q(X2)
& ( r(X2)
| p(X2) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X0] :
? [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(X1)
| ~ q(X0)
| p(X0) )
& ! [X2] :
( q(X2)
& ( r(X2)
| p(X2) ) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X0] :
? [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(X1)
| ~ q(X0)
| p(X0) )
& ! [X2] : q(X2) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f6,plain,
! [X0] :
( ? [X1] :
( ~ q(d)
| ~ q(c)
| ~ q(X1)
| ~ q(X0)
| p(X0) )
=> ( ~ q(d)
| ~ q(c)
| ~ q(sK0(X0))
| ~ q(X0)
| p(X0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ( ~ p(b)
| ~ p(a) )
& ! [X0] :
( ~ q(d)
| ~ q(c)
| ~ q(sK0(X0))
| ~ q(X0)
| p(X0) )
& ! [X2] : q(X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).
fof(f8,plain,
! [X2] : q(X2),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X0] :
( ~ q(d)
| ~ q(c)
| ~ q(sK0(X0))
| ~ q(X0)
| p(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
( ~ p(b)
| ~ p(a) ),
inference(cnf_transformation,[],[f7]) ).
cnf(c_49,negated_conjecture,
( ~ p(b)
| ~ p(a) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,negated_conjecture,
( ~ q(sK0(X0))
| ~ q(X0)
| ~ q(d)
| ~ q(c)
| p(X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_51,negated_conjecture,
q(X0),
inference(cnf_transformation,[],[f8]) ).
cnf(c_54,negated_conjecture,
( ~ q(sK0(X0))
| ~ q(d)
| ~ q(c)
| p(X0) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_51,c_50]) ).
cnf(c_59,plain,
( ~ q(d)
| ~ q(c)
| p(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_51]) ).
cnf(c_68,plain,
p(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_59,c_51,c_51]) ).
cnf(c_69,plain,
p(a),
inference(instantiation,[status(thm)],[c_68]) ).
cnf(c_73,plain,
~ p(a),
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_68]) ).
cnf(c_74,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_73,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN722+1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 17:19:41 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.86/1.17 % SZS status Started for theBenchmark.p
% 0.86/1.17 % SZS status Theorem for theBenchmark.p
% 0.86/1.17
% 0.86/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.86/1.17
% 0.86/1.17 ------ iProver source info
% 0.86/1.17
% 0.86/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.86/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.86/1.17 git: non_committed_changes: false
% 0.86/1.17 git: last_make_outside_of_git: false
% 0.86/1.17
% 0.86/1.17 ------ Parsing...
% 0.86/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.86/1.17
% 0.86/1.17 ------ Preprocessing...
% 0.86/1.17
% 0.86/1.17 % SZS status Theorem for theBenchmark.p
% 0.86/1.17
% 0.86/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.86/1.17
% 0.86/1.17
%------------------------------------------------------------------------------