TSTP Solution File: SYN726+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN726+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:09:36 EDT 2023
% Result : Theorem 1.81s 1.16s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 46 ( 7 unt; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 190 ( 70 ~; 71 |; 35 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 127 ( 0 sgn; 92 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0,X1] : q(X0,X1)
| ( ( ! [X0,X1] :
( q(X0,X1)
| p(X0,X1) )
& ! [X0,X1] :
( q(X0,X1)
=> q(X1,X0) )
& ! [X0,X1,X2] :
( ( q(X1,X2)
& q(X0,X1) )
=> q(X0,X2) )
& ! [X0,X1,X2] :
( ( p(X1,X2)
& p(X0,X1) )
=> p(X0,X2) ) )
=> ! [X0,X1] : p(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm400) ).
fof(f2,negated_conjecture,
~ ( ! [X0,X1] : q(X0,X1)
| ( ( ! [X0,X1] :
( q(X0,X1)
| p(X0,X1) )
& ! [X0,X1] :
( q(X0,X1)
=> q(X1,X0) )
& ! [X0,X1,X2] :
( ( q(X1,X2)
& q(X0,X1) )
=> q(X0,X2) )
& ! [X0,X1,X2] :
( ( p(X1,X2)
& p(X0,X1) )
=> p(X0,X2) ) )
=> ! [X0,X1] : p(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ! [X0,X1] : q(X0,X1)
| ( ( ! [X2,X3] :
( q(X2,X3)
| p(X2,X3) )
& ! [X4,X5] :
( q(X4,X5)
=> q(X5,X4) )
& ! [X6,X7,X8] :
( ( q(X7,X8)
& q(X6,X7) )
=> q(X6,X8) )
& ! [X9,X10,X11] :
( ( p(X10,X11)
& p(X9,X10) )
=> p(X9,X11) ) )
=> ! [X12,X13] : p(X12,X13) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X0,X1] : ~ q(X0,X1)
& ? [X12,X13] : ~ p(X12,X13)
& ! [X2,X3] :
( q(X2,X3)
| p(X2,X3) )
& ! [X4,X5] :
( q(X5,X4)
| ~ q(X4,X5) )
& ! [X6,X7,X8] :
( q(X6,X8)
| ~ q(X7,X8)
| ~ q(X6,X7) )
& ! [X9,X10,X11] :
( p(X9,X11)
| ~ p(X10,X11)
| ~ p(X9,X10) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X0,X1] : ~ q(X0,X1)
& ? [X12,X13] : ~ p(X12,X13)
& ! [X2,X3] :
( q(X2,X3)
| p(X2,X3) )
& ! [X4,X5] :
( q(X5,X4)
| ~ q(X4,X5) )
& ! [X6,X7,X8] :
( q(X6,X8)
| ~ q(X7,X8)
| ~ q(X6,X7) )
& ! [X9,X10,X11] :
( p(X9,X11)
| ~ p(X10,X11)
| ~ p(X9,X10) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0,X1] : ~ q(X0,X1)
& ? [X2,X3] : ~ p(X2,X3)
& ! [X4,X5] :
( q(X4,X5)
| p(X4,X5) )
& ! [X6,X7] :
( q(X7,X6)
| ~ q(X6,X7) )
& ! [X8,X9,X10] :
( q(X8,X10)
| ~ q(X9,X10)
| ~ q(X8,X9) )
& ! [X11,X12,X13] :
( p(X11,X13)
| ~ p(X12,X13)
| ~ p(X11,X12) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0,X1] : ~ q(X0,X1)
=> ~ q(sK0,sK1) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2,X3] : ~ p(X2,X3)
=> ~ p(sK2,sK3) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ~ q(sK0,sK1)
& ~ p(sK2,sK3)
& ! [X4,X5] :
( q(X4,X5)
| p(X4,X5) )
& ! [X6,X7] :
( q(X7,X6)
| ~ q(X6,X7) )
& ! [X8,X9,X10] :
( q(X8,X10)
| ~ q(X9,X10)
| ~ q(X8,X9) )
& ! [X11,X12,X13] :
( p(X11,X13)
| ~ p(X12,X13)
| ~ p(X11,X12) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f6,f8,f7]) ).
fof(f10,plain,
! [X11,X12,X13] :
( p(X11,X13)
| ~ p(X12,X13)
| ~ p(X11,X12) ),
inference(cnf_transformation,[],[f9]) ).
fof(f11,plain,
! [X10,X8,X9] :
( q(X8,X10)
| ~ q(X9,X10)
| ~ q(X8,X9) ),
inference(cnf_transformation,[],[f9]) ).
fof(f12,plain,
! [X6,X7] :
( q(X7,X6)
| ~ q(X6,X7) ),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
! [X4,X5] :
( q(X4,X5)
| p(X4,X5) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
~ p(sK2,sK3),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
~ q(sK0,sK1),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
~ q(sK0,sK1),
inference(cnf_transformation,[],[f15]) ).
cnf(c_50,negated_conjecture,
~ p(sK2,sK3),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,negated_conjecture,
( q(X0,X1)
| p(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_52,negated_conjecture,
( ~ q(X0,X1)
| q(X1,X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_53,negated_conjecture,
( ~ q(X0,X1)
| ~ q(X1,X2)
| q(X0,X2) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_54,negated_conjecture,
( ~ p(X0,X1)
| ~ p(X1,X2)
| p(X0,X2) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_81,plain,
( ~ q(sK1,sK0)
| q(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_82,plain,
( ~ q(X0,sK1)
| ~ q(sK0,X0)
| q(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_86,plain,
( ~ q(X0,sK0)
| ~ q(sK1,X0)
| q(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_87,plain,
( q(X0,sK1)
| p(X0,sK1) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_93,plain,
( q(sK1,X0)
| p(sK1,X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_103,plain,
( ~ p(X0,sK3)
| ~ p(sK2,X0)
| p(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_104,plain,
( ~ p(sK0,sK3)
| ~ p(sK2,sK0)
| p(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_103]) ).
cnf(c_112,plain,
( ~ p(sK1,sK3)
| ~ p(sK2,sK1)
| p(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_103]) ).
cnf(c_113,plain,
( q(sK1,sK3)
| p(sK1,sK3) ),
inference(instantiation,[status(thm)],[c_93]) ).
cnf(c_123,plain,
( q(sK2,sK1)
| p(sK2,sK1) ),
inference(instantiation,[status(thm)],[c_87]) ).
cnf(c_128,plain,
q(sK2,sK3),
inference(superposition,[status(thm)],[c_51,c_50]) ).
cnf(c_133,plain,
( ~ q(sK0,sK2)
| ~ q(sK2,sK1)
| q(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_139,plain,
( ~ q(sK1,sK3)
| ~ q(sK3,sK0)
| q(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_86]) ).
cnf(c_191,plain,
( ~ q(sK3,X0)
| q(sK2,X0) ),
inference(superposition,[status(thm)],[c_128,c_53]) ).
cnf(c_192,plain,
q(sK3,sK2),
inference(superposition,[status(thm)],[c_128,c_52]) ).
cnf(c_195,plain,
( ~ q(sK3,sK0)
| q(sK2,sK0) ),
inference(instantiation,[status(thm)],[c_191]) ).
cnf(c_201,plain,
( ~ q(sK0,sK3)
| q(sK3,sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_205,plain,
( ~ q(sK2,X0)
| q(X0,sK2) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_206,plain,
( ~ q(sK2,sK0)
| q(sK0,sK2) ),
inference(instantiation,[status(thm)],[c_205]) ).
cnf(c_237,plain,
( ~ q(sK2,X0)
| q(sK3,X0) ),
inference(superposition,[status(thm)],[c_192,c_53]) ).
cnf(c_241,plain,
( ~ q(sK2,sK0)
| q(sK3,sK0) ),
inference(instantiation,[status(thm)],[c_237]) ).
cnf(c_255,plain,
( q(sK0,sK3)
| p(sK0,sK3) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_285,plain,
( q(sK2,X0)
| p(sK2,X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_286,plain,
( q(sK2,sK0)
| p(sK2,sK0) ),
inference(instantiation,[status(thm)],[c_285]) ).
cnf(c_352,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_286,c_255,c_241,c_206,c_201,c_195,c_139,c_133,c_123,c_113,c_112,c_104,c_81,c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN726+1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 20:01:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.81/1.16 % SZS status Started for theBenchmark.p
% 1.81/1.16 % SZS status Theorem for theBenchmark.p
% 1.81/1.16
% 1.81/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.81/1.16
% 1.81/1.16 ------ iProver source info
% 1.81/1.16
% 1.81/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.81/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.81/1.16 git: non_committed_changes: false
% 1.81/1.16 git: last_make_outside_of_git: false
% 1.81/1.16
% 1.81/1.16 ------ Parsing...
% 1.81/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.81/1.16
% 1.81/1.16
% 1.81/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.81/1.16
% 1.81/1.16 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 1.81/1.16 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.81/1.16 ------ Proving...
% 1.81/1.16 ------ Problem Properties
% 1.81/1.16
% 1.81/1.16
% 1.81/1.16 clauses 6
% 1.81/1.16 conjectures 6
% 1.81/1.16 EPR 6
% 1.81/1.16 Horn 5
% 1.81/1.16 unary 2
% 1.81/1.16 binary 2
% 1.81/1.16 lits 12
% 1.81/1.16 lits eq 0
% 1.81/1.16 fd_pure 0
% 1.81/1.16 fd_pseudo 0
% 1.81/1.16 fd_cond 0
% 1.81/1.16 fd_pseudo_cond 0
% 1.81/1.16 AC symbols 0
% 1.81/1.16
% 1.81/1.16 ------ Schedule EPR non Horn non eq is on
% 1.81/1.16
% 1.81/1.16 ------ no equalities: superposition off
% 1.81/1.16
% 1.81/1.16 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.81/1.16
% 1.81/1.16
% 1.81/1.16 ------
% 1.81/1.16 Current options:
% 1.81/1.16 ------
% 1.81/1.16
% 1.81/1.16
% 1.81/1.16
% 1.81/1.16
% 1.81/1.16 ------ Proving...
% 1.81/1.16
% 1.81/1.16
% 1.81/1.16 % SZS status Theorem for theBenchmark.p
% 1.81/1.16
% 1.81/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.81/1.16
% 1.81/1.16
%------------------------------------------------------------------------------