TSTP Solution File: SYN954+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN954+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:14:55 EDT 2023
% Result : Theorem 0.71s 1.15s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 76 ( 28 ~; 22 |; 17 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 34 ( 4 sgn; 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
( ! [X2] :
( q(X2)
=> p(X2) )
=> ? [X3] :
( ( q(X3)
=> p(X1) )
& ( p(X3)
=> p(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( q(X2)
=> p(X2) )
=> ? [X3] :
( ( q(X3)
=> p(X1) )
& ( p(X3)
=> p(X0) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
? [X0,X1] :
( ! [X3] :
( ( ~ p(X1)
& q(X3) )
| ( ~ p(X0)
& p(X3) ) )
& ! [X2] :
( p(X2)
| ~ q(X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
( ! [X2] :
( ( ~ p(X1)
& q(X2) )
| ( ~ p(X0)
& p(X2) ) )
& ! [X3] :
( p(X3)
| ~ q(X3) ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
( ? [X0,X1] :
( ! [X2] :
( ( ~ p(X1)
& q(X2) )
| ( ~ p(X0)
& p(X2) ) )
& ! [X3] :
( p(X3)
| ~ q(X3) ) )
=> ( ! [X2] :
( ( ~ p(sK1)
& q(X2) )
| ( ~ p(sK0)
& p(X2) ) )
& ! [X3] :
( p(X3)
| ~ q(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X2] :
( ( ~ p(sK1)
& q(X2) )
| ( ~ p(sK0)
& p(X2) ) )
& ! [X3] :
( p(X3)
| ~ q(X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).
fof(f7,plain,
! [X3] :
( p(X3)
| ~ q(X3) ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X2] :
( q(X2)
| p(X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X2] :
( q(X2)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2] :
( ~ p(sK1)
| p(X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f11,plain,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,negated_conjecture,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_50,negated_conjecture,
( ~ p(sK1)
| p(X0) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_51,negated_conjecture,
( ~ p(sK0)
| q(X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_52,negated_conjecture,
( p(X0)
| q(X0) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_53,negated_conjecture,
( ~ q(X0)
| p(X0) ),
inference(cnf_transformation,[],[f7]) ).
cnf(c_54,plain,
( p(sK0)
| q(sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_55,plain,
( ~ q(sK0)
| p(sK0) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_58,negated_conjecture,
q(X0),
inference(global_subsumption_just,[status(thm)],[c_52,c_54,c_55,c_51]) ).
cnf(c_60,plain,
q(sK0),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_66,negated_conjecture,
p(X0),
inference(global_subsumption_just,[status(thm)],[c_50,c_54,c_53,c_55,c_51]) ).
cnf(c_68,negated_conjecture,
~ p(sK1),
inference(global_subsumption_just,[status(thm)],[c_49,c_55,c_49,c_60]) ).
cnf(c_74,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN954+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Aug 26 18:07:07 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.71/1.15 % SZS status Started for theBenchmark.p
% 0.71/1.15 % SZS status Theorem for theBenchmark.p
% 0.71/1.15
% 0.71/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.71/1.15
% 0.71/1.15 ------ iProver source info
% 0.71/1.15
% 0.71/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.71/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.71/1.15 git: non_committed_changes: false
% 0.71/1.15 git: last_make_outside_of_git: false
% 0.71/1.15
% 0.71/1.15 ------ Parsing...
% 0.71/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.71/1.15
% 0.71/1.15
% 0.71/1.15 ------ Preprocessing...
% 0.71/1.15
% 0.71/1.15 % SZS status Theorem for theBenchmark.p
% 0.71/1.15
% 0.71/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.71/1.15
% 0.71/1.15
%------------------------------------------------------------------------------