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