TSTP Solution File: SYN968+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN968+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:33:44 EDT 2024
% Result : Theorem 0.50s 1.18s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 5 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 0 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 13 ( 2 sgn 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [X0] :
! [X1] :
( p(X0)
=> p(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1] :
( p(X0)
=> p(X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
! [X0] :
? [X1] :
( ~ p(X1)
& p(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X0] :
( ? [X1] :
( ~ p(X1)
& p(X0) )
=> ( ~ p(sK0(X0))
& p(X0) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
! [X0] :
( ~ p(sK0(X0))
& p(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f3,f4]) ).
fof(f6,plain,
! [X0] : p(X0),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X0] : ~ p(sK0(X0)),
inference(cnf_transformation,[],[f5]) ).
cnf(c_49,negated_conjecture,
~ p(sK0(X0)),
inference(cnf_transformation,[],[f7]) ).
cnf(c_50,negated_conjecture,
p(X0),
inference(cnf_transformation,[],[f6]) ).
cnf(c_55,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN968+1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n011.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 21:02:18 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.50/1.18 % SZS status Started for theBenchmark.p
% 0.50/1.18 % SZS status Theorem for theBenchmark.p
% 0.50/1.18
% 0.50/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.50/1.18
% 0.50/1.18 ------ iProver source info
% 0.50/1.18
% 0.50/1.18 git: date: 2024-05-02 19:28:25 +0000
% 0.50/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.50/1.18 git: non_committed_changes: false
% 0.50/1.18
% 0.50/1.18 ------ Parsing...
% 0.50/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.50/1.18
% 0.50/1.18 ------ Preprocessing...
% 0.50/1.18
% 0.50/1.18 % SZS status Theorem for theBenchmark.p
% 0.50/1.18
% 0.50/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.50/1.18
% 0.50/1.18
%------------------------------------------------------------------------------