TSTP Solution File: SYN367+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN367+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:30:20 EDT 2024
% Result : Theorem 0.76s 1.18s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 71 ( 27 ~; 17 |; 22 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 28 ( 3 sgn 16 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) )
=> ( ! [X0] : big_r(X0)
| ! [X0] : big_q(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2118) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) )
=> ( ! [X0] : big_r(X0)
| ! [X0] : big_q(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) )
=> ( ! [X1] : big_r(X1)
| ! [X2] : big_q(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X1] : ~ big_r(X1)
& ? [X2] : ~ big_q(X2)
& ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X1] : ~ big_r(X1)
& ? [X2] : ~ big_q(X2)
& ! [X0] :
( ( big_r(X0)
& ~ p )
| ( big_q(X0)
& p ) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0] : ~ big_r(X0)
& ? [X1] : ~ big_q(X1)
& ! [X2] :
( ( big_r(X2)
& ~ p )
| ( big_q(X2)
& p ) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0] : ~ big_r(X0)
=> ~ big_r(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X1] : ~ big_q(X1)
=> ~ big_q(sK1) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ~ big_r(sK0)
& ~ big_q(sK1)
& ! [X2] :
( ( big_r(X2)
& ~ p )
| ( big_q(X2)
& p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f11,plain,
! [X2] :
( ~ p
| big_q(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X2] :
( big_r(X2)
| p ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X2] :
( big_r(X2)
| big_q(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
~ big_q(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
~ big_r(sK0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
~ big_r(sK0),
inference(cnf_transformation,[],[f15]) ).
cnf(c_50,negated_conjecture,
~ big_q(sK1),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,negated_conjecture,
( big_r(X0)
| big_q(X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_52,negated_conjecture,
( big_r(X0)
| p ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_53,negated_conjecture,
( ~ p
| big_q(X0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_54,plain,
( big_r(sK0)
| p ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_62,negated_conjecture,
big_q(X0),
inference(global_subsumption_just,[status(thm)],[c_51,c_54,c_49,c_53]) ).
cnf(c_68,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN367+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu May 2 21:02:27 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.76/1.18 % SZS status Started for theBenchmark.p
% 0.76/1.18 % SZS status Theorem for theBenchmark.p
% 0.76/1.18
% 0.76/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.76/1.18
% 0.76/1.18 ------ iProver source info
% 0.76/1.18
% 0.76/1.18 git: date: 2024-05-02 19:28:25 +0000
% 0.76/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.76/1.18 git: non_committed_changes: false
% 0.76/1.18
% 0.76/1.18 ------ Parsing...
% 0.76/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.76/1.18
% 0.76/1.18
% 0.76/1.18 ------ Preprocessing...
% 0.76/1.18
% 0.76/1.18 % SZS status Theorem for theBenchmark.p
% 0.76/1.18
% 0.76/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.76/1.18
% 0.76/1.18
%------------------------------------------------------------------------------