TSTP Solution File: SYN920+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN920+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:46 EDT 2023
% Result : Theorem 0.79s 1.17s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 5 unt; 0 def)
% Number of atoms : 172 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 208 ( 71 ~; 66 |; 48 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 50 ( 0 sgn; 32 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ( ! [X2] :
( f(X2)
=> h(X2) )
| ! [X1] :
( f(X1)
=> g(X1) ) )
& ( ! [X0] :
( ( g(X0)
& f(X0) )
=> h(X0) )
=> ? [X0] :
( ~ g(X0)
& f(X0) ) ) )
=> ( ! [X3] :
( ( h(X3)
& f(X3) )
=> g(X3) )
=> ? [X4] :
( ~ h(X4)
& g(X4)
& f(X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ( ( ! [X2] :
( f(X2)
=> h(X2) )
| ! [X1] :
( f(X1)
=> g(X1) ) )
& ( ! [X0] :
( ( g(X0)
& f(X0) )
=> h(X0) )
=> ? [X0] :
( ~ g(X0)
& f(X0) ) ) )
=> ( ! [X3] :
( ( h(X3)
& f(X3) )
=> g(X3) )
=> ? [X4] :
( ~ h(X4)
& g(X4)
& f(X4) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ( ! [X0] :
( f(X0)
=> h(X0) )
| ! [X1] :
( f(X1)
=> g(X1) ) )
& ( ! [X2] :
( ( g(X2)
& f(X2) )
=> h(X2) )
=> ? [X3] :
( ~ g(X3)
& f(X3) ) ) )
=> ( ! [X4] :
( ( h(X4)
& f(X4) )
=> g(X4) )
=> ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X5] :
( h(X5)
| ~ g(X5)
| ~ f(X5) )
& ! [X4] :
( g(X4)
| ~ h(X4)
| ~ f(X4) )
& ( ! [X0] :
( h(X0)
| ~ f(X0) )
| ! [X1] :
( g(X1)
| ~ f(X1) ) )
& ( ? [X3] :
( ~ g(X3)
& f(X3) )
| ? [X2] :
( ~ h(X2)
& g(X2)
& f(X2) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X5] :
( h(X5)
| ~ g(X5)
| ~ f(X5) )
& ! [X4] :
( g(X4)
| ~ h(X4)
| ~ f(X4) )
& ( ! [X0] :
( h(X0)
| ~ f(X0) )
| ! [X1] :
( g(X1)
| ~ f(X1) ) )
& ( ? [X3] :
( ~ g(X3)
& f(X3) )
| ? [X2] :
( ~ h(X2)
& g(X2)
& f(X2) ) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X0] :
( h(X0)
| ~ g(X0)
| ~ f(X0) )
& ! [X1] :
( g(X1)
| ~ h(X1)
| ~ f(X1) )
& ( ! [X2] :
( h(X2)
| ~ f(X2) )
| ! [X3] :
( g(X3)
| ~ f(X3) ) )
& ( ? [X4] :
( ~ g(X4)
& f(X4) )
| ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X4] :
( ~ g(X4)
& f(X4) )
=> ( ~ g(sK0)
& f(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) )
=> ( ~ h(sK1)
& g(sK1)
& f(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ! [X0] :
( h(X0)
| ~ g(X0)
| ~ f(X0) )
& ! [X1] :
( g(X1)
| ~ h(X1)
| ~ f(X1) )
& ( ! [X2] :
( h(X2)
| ~ f(X2) )
| ! [X3] :
( g(X3)
| ~ f(X3) ) )
& ( ( ~ g(sK0)
& f(sK0) )
| ( ~ h(sK1)
& g(sK1)
& f(sK1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f10,plain,
( f(sK0)
| f(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
( f(sK0)
| g(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
( f(sK0)
| ~ h(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
( ~ g(sK0)
| f(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
( ~ g(sK0)
| g(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
( ~ g(sK0)
| ~ h(sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X2,X3] :
( h(X2)
| ~ f(X2)
| g(X3)
| ~ f(X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
! [X1] :
( g(X1)
| ~ h(X1)
| ~ f(X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
! [X0] :
( h(X0)
| ~ g(X0)
| ~ f(X0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
( ~ g(X0)
| ~ f(X0)
| h(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_50,negated_conjecture,
( ~ h(X0)
| ~ f(X0)
| g(X0) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_51,negated_conjecture,
( ~ f(X0)
| ~ f(X1)
| h(X0)
| g(X1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_52,negated_conjecture,
( ~ h(sK1)
| ~ g(sK0) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_53,negated_conjecture,
( ~ g(sK0)
| g(sK1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_54,negated_conjecture,
( ~ g(sK0)
| f(sK1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_55,negated_conjecture,
( ~ h(sK1)
| f(sK0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_56,negated_conjecture,
( g(sK1)
| f(sK0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_57,negated_conjecture,
( f(sK0)
| f(sK1) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_58,plain,
( ~ h(sK0)
| ~ f(sK0)
| g(sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_60,plain,
( ~ f(sK0)
| h(sK0)
| g(sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_61,negated_conjecture,
f(sK1),
inference(global_subsumption_just,[status(thm)],[c_57,c_57,c_54,c_58,c_60]) ).
cnf(c_63,negated_conjecture,
g(sK1),
inference(global_subsumption_just,[status(thm)],[c_56,c_56,c_53,c_58,c_60]) ).
cnf(c_65,negated_conjecture,
~ h(sK1),
inference(global_subsumption_just,[status(thm)],[c_55,c_55,c_52,c_58,c_60]) ).
cnf(c_69,negated_conjecture,
g(sK1),
inference(global_subsumption_just,[status(thm)],[c_53,c_63]) ).
cnf(c_114,plain,
( ~ f(sK1)
| h(sK1) ),
inference(resolution,[status(thm)],[c_49,c_69]) ).
cnf(c_115,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_114,c_65,c_61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN920+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n003.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 : Sat Aug 26 19:15:39 EDT 2023
% 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 --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.79/1.17 % SZS status Started for theBenchmark.p
% 0.79/1.17 % SZS status Theorem for theBenchmark.p
% 0.79/1.17
% 0.79/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.79/1.17
% 0.79/1.17 ------ iProver source info
% 0.79/1.17
% 0.79/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.79/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.79/1.17 git: non_committed_changes: false
% 0.79/1.17 git: last_make_outside_of_git: false
% 0.79/1.17
% 0.79/1.17 ------ Parsing...
% 0.79/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s
% 0.79/1.17
% 0.79/1.17 % SZS status Theorem for theBenchmark.p
% 0.79/1.17
% 0.79/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.79/1.17
% 0.79/1.17
%------------------------------------------------------------------------------