TSTP Solution File: SYN362+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN362+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:18 EDT 2024
% Result : Theorem 0.75s 1.15s
% Output : CNFRefutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 25 ~; 8 |; 11 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 45 ( 2 sgn 24 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ? [X2] :
! [X3] :
( big_p(X3)
=> ~ big_r(X2,X3) )
& ! [X0] :
? [X1] : big_r(X0,X1) )
=> ? [X3] : ~ big_p(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2113) ).
fof(f2,negated_conjecture,
~ ( ( ? [X2] :
! [X3] :
( big_p(X3)
=> ~ big_r(X2,X3) )
& ! [X0] :
? [X1] : big_r(X0,X1) )
=> ? [X3] : ~ big_p(X3) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ? [X0] :
! [X1] :
( big_p(X1)
=> ~ big_r(X0,X1) )
& ! [X2] :
? [X3] : big_r(X2,X3) )
=> ? [X4] : ~ big_p(X4) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X4] : big_p(X4)
& ? [X0] :
! [X1] :
( ~ big_r(X0,X1)
| ~ big_p(X1) )
& ! [X2] :
? [X3] : big_r(X2,X3) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X4] : big_p(X4)
& ? [X0] :
! [X1] :
( ~ big_r(X0,X1)
| ~ big_p(X1) )
& ! [X2] :
? [X3] : big_r(X2,X3) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X0] : big_p(X0)
& ? [X1] :
! [X2] :
( ~ big_r(X1,X2)
| ~ big_p(X2) )
& ! [X3] :
? [X4] : big_r(X3,X4) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X1] :
! [X2] :
( ~ big_r(X1,X2)
| ~ big_p(X2) )
=> ! [X2] :
( ~ big_r(sK0,X2)
| ~ big_p(X2) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X3] :
( ? [X4] : big_r(X3,X4)
=> big_r(X3,sK1(X3)) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ! [X0] : big_p(X0)
& ! [X2] :
( ~ big_r(sK0,X2)
| ~ big_p(X2) )
& ! [X3] : big_r(X3,sK1(X3)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f10,plain,
! [X3] : big_r(X3,sK1(X3)),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X2] :
( ~ big_r(sK0,X2)
| ~ big_p(X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0] : big_p(X0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
big_p(X0),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,negated_conjecture,
( ~ big_r(sK0,X0)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_51,negated_conjecture,
big_r(X0,sK1(X0)),
inference(cnf_transformation,[],[f10]) ).
cnf(c_55,negated_conjecture,
~ big_r(sK0,X0),
inference(global_subsumption_just,[status(thm)],[c_50,c_49,c_50]) ).
cnf(c_64,plain,
$false,
inference(resolution,[status(thm)],[c_55,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN362+1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 20:50:46 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.75/1.15 % SZS status Started for theBenchmark.p
% 0.75/1.15 % SZS status Theorem for theBenchmark.p
% 0.75/1.15
% 0.75/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.75/1.15
% 0.75/1.15 ------ iProver source info
% 0.75/1.15
% 0.75/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.75/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.75/1.15 git: non_committed_changes: false
% 0.75/1.15
% 0.75/1.15 ------ Parsing...
% 0.75/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.75/1.15
% 0.75/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s
% 0.75/1.15
% 0.75/1.15 % SZS status Theorem for theBenchmark.p
% 0.75/1.15
% 0.75/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.75/1.15
% 0.75/1.15
%------------------------------------------------------------------------------