TSTP Solution File: SYN726+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN726+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:32:14 EDT 2024
% Result : Theorem 1.81s 1.25s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 50 ( 5 unt; 0 def)
% Number of atoms : 182 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 211 ( 79 ~; 83 |; 35 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 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 : 137 ( 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_80,negated_conjecture,
( ~ p(X0,X1)
| ~ p(X1,X2)
| p(X0,X2) ),
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_81,negated_conjecture,
( ~ q(X0,X1)
| ~ q(X1,X2)
| q(X0,X2) ),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_82,negated_conjecture,
( ~ q(X0,X1)
| q(X1,X0) ),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_83,negated_conjecture,
( q(X0,X1)
| p(X0,X1) ),
inference(demodulation,[status(thm)],[c_51]) ).
cnf(c_86,plain,
( ~ q(sK1,sK0)
| q(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_87,plain,
( q(sK0,sK1)
| p(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_88,plain,
( ~ q(X0,sK1)
| ~ q(sK0,X0)
| q(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_81]) ).
cnf(c_89,plain,
( q(sK1,sK0)
| p(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_91,plain,
( ~ q(X0,sK0)
| ~ q(sK1,X0)
| q(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_81]) ).
cnf(c_92,plain,
( ~ p(X0,sK0)
| ~ p(sK0,sK1)
| p(X0,sK1) ),
inference(instantiation,[status(thm)],[c_80]) ).
cnf(c_93,plain,
( q(X0,sK1)
| p(X0,sK1) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_96,plain,
( ~ p(X0,sK1)
| ~ p(sK1,sK0)
| p(X0,sK0) ),
inference(instantiation,[status(thm)],[c_80]) ).
cnf(c_98,plain,
( q(sK1,X0)
| p(sK1,X0) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_109,plain,
( ~ p(X0,sK3)
| ~ p(sK2,X0)
| p(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_80]) ).
cnf(c_110,plain,
( ~ p(sK0,sK3)
| ~ p(sK2,sK0)
| p(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_109]) ).
cnf(c_118,plain,
( ~ p(sK1,sK3)
| ~ p(sK2,sK1)
| p(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_109]) ).
cnf(c_119,plain,
( q(sK1,sK3)
| p(sK1,sK3) ),
inference(instantiation,[status(thm)],[c_98]) ).
cnf(c_128,plain,
( ~ p(sK0,sK1)
| ~ p(sK2,sK0)
| p(sK2,sK1) ),
inference(instantiation,[status(thm)],[c_92]) ).
cnf(c_129,plain,
( q(sK2,sK1)
| p(sK2,sK1) ),
inference(instantiation,[status(thm)],[c_93]) ).
cnf(c_131,plain,
( ~ p(sK1,sK0)
| ~ p(sK2,sK1)
| p(sK2,sK0) ),
inference(instantiation,[status(thm)],[c_96]) ).
cnf(c_139,plain,
( ~ q(sK0,sK2)
| ~ q(sK2,sK1)
| q(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_88]) ).
cnf(c_145,plain,
( ~ q(sK1,sK3)
| ~ q(sK3,sK0)
| q(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_91]) ).
cnf(c_198,plain,
( ~ q(sK0,sK3)
| q(sK3,sK0) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_211,plain,
( ~ q(sK2,X0)
| q(X0,sK2) ),
inference(instantiation,[status(thm)],[c_82]) ).
cnf(c_212,plain,
( ~ q(sK2,sK0)
| q(sK0,sK2) ),
inference(instantiation,[status(thm)],[c_211]) ).
cnf(c_261,plain,
( q(sK0,sK3)
| p(sK0,sK3) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_291,plain,
( q(sK2,X0)
| p(sK2,X0) ),
inference(instantiation,[status(thm)],[c_83]) ).
cnf(c_292,plain,
( q(sK2,sK0)
| p(sK2,sK0) ),
inference(instantiation,[status(thm)],[c_291]) ).
cnf(c_293,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_292,c_261,c_212,c_198,c_145,c_139,c_131,c_128,c_129,c_119,c_118,c_110,c_89,c_87,c_86,c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.16 % Problem : SYN726+1 : TPTP v8.1.2. Released v2.5.0.
% 0.03/0.17 % Command : run_iprover %s %d THM
% 0.14/0.38 % Computer : n002.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Thu May 2 21:16:57 EDT 2024
% 0.14/0.39 % CPUTime :
% 0.20/0.52 Running first-order theorem proving
% 0.20/0.52 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
% 1.81/1.25 % SZS status Started for theBenchmark.p
% 1.81/1.25 % SZS status Theorem for theBenchmark.p
% 1.81/1.25
% 1.81/1.25 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.81/1.25
% 1.81/1.25 ------ iProver source info
% 1.81/1.25
% 1.81/1.25 git: date: 2024-05-02 19:28:25 +0000
% 1.81/1.25 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.81/1.25 git: non_committed_changes: false
% 1.81/1.25
% 1.81/1.25 ------ Parsing...
% 1.81/1.25 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.81/1.25
% 1.81/1.25
% 1.81/1.25 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.81/1.25
% 1.81/1.25 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 1.81/1.25 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.81/1.25 ------ Proving...
% 1.81/1.25 ------ Problem Properties
% 1.81/1.25
% 1.81/1.25
% 1.81/1.25 clauses 6
% 1.81/1.25 conjectures 6
% 1.81/1.25 EPR 6
% 1.81/1.25 Horn 5
% 1.81/1.25 unary 2
% 1.81/1.25 binary 2
% 1.81/1.25 lits 12
% 1.81/1.25 lits eq 0
% 1.81/1.25 fd_pure 0
% 1.81/1.25 fd_pseudo 0
% 1.81/1.25 fd_cond 0
% 1.81/1.25 fd_pseudo_cond 0
% 1.81/1.25 AC symbols 0
% 1.81/1.25
% 1.81/1.25 ------ Schedule EPR non Horn non eq is on
% 1.81/1.25
% 1.81/1.25 ------ no equalities: superposition off
% 1.81/1.25
% 1.81/1.25 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.81/1.25
% 1.81/1.25
% 1.81/1.25 ------
% 1.81/1.25 Current options:
% 1.81/1.25 ------
% 1.81/1.25
% 1.81/1.25
% 1.81/1.25
% 1.81/1.25
% 1.81/1.25 ------ Proving...
% 1.81/1.25
% 1.81/1.25
% 1.81/1.25 % SZS status Theorem for theBenchmark.p
% 1.81/1.25
% 1.81/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.81/1.25
% 1.81/1.25
%------------------------------------------------------------------------------