TSTP Solution File: SYN415+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN415+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:30:34 EDT 2024
% Result : Theorem 2.17s 1.13s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 5 unt; 0 def)
% Number of atoms : 238 ( 60 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 281 ( 105 ~; 111 |; 48 &)
% ( 4 <=>; 10 =>; 0 <=; 3 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 97 ( 4 sgn 47 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X1,X2] :
( ( f(X2)
& f(X1) )
=> X1 = X2 )
& ? [X0] : f(X0) )
<=> ? [X3] :
( ! [X4] :
( f(X4)
=> X3 = X4 )
& f(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish317) ).
fof(f2,negated_conjecture,
~ ( ( ! [X1,X2] :
( ( f(X2)
& f(X1) )
=> X1 = X2 )
& ? [X0] : f(X0) )
<=> ? [X3] :
( ! [X4] :
( f(X4)
=> X3 = X4 )
& f(X3) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0,X1] :
( ( f(X1)
& f(X0) )
=> X0 = X1 )
& ? [X2] : f(X2) )
<=> ? [X3] :
( ! [X4] :
( f(X4)
=> X3 = X4 )
& f(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ( ! [X0,X1] :
( X0 = X1
| ~ f(X1)
| ~ f(X0) )
& ? [X2] : f(X2) )
<~> ? [X3] :
( ! [X4] :
( X3 = X4
| ~ f(X4) )
& f(X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X0,X1] :
( X0 = X1
| ~ f(X1)
| ~ f(X0) )
& ? [X2] : f(X2) )
<~> ? [X3] :
( ! [X4] :
( X3 = X4
| ~ f(X4) )
& f(X3) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( sP0
<=> ( ! [X0,X1] :
( X0 = X1
| ~ f(X1)
| ~ f(X0) )
& ? [X2] : f(X2) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f7,plain,
( sP0
<~> ? [X3] :
( ! [X4] :
( X3 = X4
| ~ f(X4) )
& f(X3) ) ),
inference(definition_folding,[],[f5,f6]) ).
fof(f8,plain,
( ( sP0
| ? [X0,X1] :
( X0 != X1
& f(X1)
& f(X0) )
| ! [X2] : ~ f(X2) )
& ( ( ! [X0,X1] :
( X0 = X1
| ~ f(X1)
| ~ f(X0) )
& ? [X2] : f(X2) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f9,plain,
( ( sP0
| ? [X0,X1] :
( X0 != X1
& f(X1)
& f(X0) )
| ! [X2] : ~ f(X2) )
& ( ( ! [X0,X1] :
( X0 = X1
| ~ f(X1)
| ~ f(X0) )
& ? [X2] : f(X2) )
| ~ sP0 ) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
( ( sP0
| ? [X0,X1] :
( X0 != X1
& f(X1)
& f(X0) )
| ! [X2] : ~ f(X2) )
& ( ( ! [X3,X4] :
( X3 = X4
| ~ f(X4)
| ~ f(X3) )
& ? [X5] : f(X5) )
| ~ sP0 ) ),
inference(rectify,[],[f9]) ).
fof(f11,plain,
( ? [X0,X1] :
( X0 != X1
& f(X1)
& f(X0) )
=> ( sK1 != sK2
& f(sK2)
& f(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X5] : f(X5)
=> f(sK3) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ( sP0
| ( sK1 != sK2
& f(sK2)
& f(sK1) )
| ! [X2] : ~ f(X2) )
& ( ( ! [X3,X4] :
( X3 = X4
| ~ f(X4)
| ~ f(X3) )
& f(sK3) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f10,f12,f11]) ).
fof(f14,plain,
( ( ! [X3] :
( ? [X4] :
( X3 != X4
& f(X4) )
| ~ f(X3) )
| ~ sP0 )
& ( ? [X3] :
( ! [X4] :
( X3 = X4
| ~ f(X4) )
& f(X3) )
| sP0 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f15,plain,
( ( ! [X0] :
( ? [X1] :
( X0 != X1
& f(X1) )
| ~ f(X0) )
| ~ sP0 )
& ( ? [X2] :
( ! [X3] :
( X2 = X3
| ~ f(X3) )
& f(X2) )
| sP0 ) ),
inference(rectify,[],[f14]) ).
fof(f16,plain,
! [X0] :
( ? [X1] :
( X0 != X1
& f(X1) )
=> ( sK4(X0) != X0
& f(sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X2] :
( ! [X3] :
( X2 = X3
| ~ f(X3) )
& f(X2) )
=> ( ! [X3] :
( sK5 = X3
| ~ f(X3) )
& f(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ( ! [X0] :
( ( sK4(X0) != X0
& f(sK4(X0)) )
| ~ f(X0) )
| ~ sP0 )
& ( ( ! [X3] :
( sK5 = X3
| ~ f(X3) )
& f(sK5) )
| sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f15,f17,f16]) ).
fof(f19,plain,
( f(sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
! [X3,X4] :
( X3 = X4
| ~ f(X4)
| ~ f(X3)
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
! [X2] :
( sP0
| f(sK1)
| ~ f(X2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
! [X2] :
( sP0
| f(sK2)
| ~ f(X2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f23,plain,
! [X2] :
( sP0
| sK1 != sK2
| ~ f(X2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
( f(sK5)
| sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f25,plain,
! [X3] :
( sK5 = X3
| ~ f(X3)
| sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
! [X0] :
( f(sK4(X0))
| ~ f(X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X0] :
( sK4(X0) != X0
| ~ f(X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_49,plain,
( sK1 != sK2
| ~ f(X0)
| sP0 ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_50,plain,
( ~ f(X0)
| f(sK2)
| sP0 ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_51,plain,
( ~ f(X0)
| f(sK1)
| sP0 ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_52,plain,
( ~ f(X0)
| ~ f(X1)
| ~ sP0
| X0 = X1 ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_53,plain,
( ~ sP0
| f(sK3) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_54,negated_conjecture,
( sK4(X0) != X0
| ~ f(X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_55,negated_conjecture,
( ~ f(X0)
| ~ sP0
| f(sK4(X0)) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_56,negated_conjecture,
( ~ f(X0)
| X0 = sK5
| sP0 ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_57,negated_conjecture,
( f(sK5)
| sP0 ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_503,plain,
( ~ f(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_51]) ).
cnf(c_504,plain,
( f(sK1)
| sP0
| sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_51]) ).
cnf(c_505,plain,
( f(sK2)
| sP0
| sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_50]) ).
cnf(c_506,plain,
( sK1 != sK2
| sP0
| sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_49]) ).
cnf(c_507,negated_conjecture,
( f(sK5)
| sP0 ),
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_508,negated_conjecture,
( ~ f(X0)
| X0 = sK5
| sP0 ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_509,negated_conjecture,
( ~ f(X0)
| ~ sP0
| f(sK4(X0)) ),
inference(demodulation,[status(thm)],[c_55]) ).
cnf(c_510,negated_conjecture,
( sK4(X0) != X0
| ~ f(X0)
| ~ sP0 ),
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_513,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_693,plain,
( sK1 = sK5
| sP0
| sP0_iProver_def ),
inference(superposition,[status(thm)],[c_504,c_508]) ).
cnf(c_709,plain,
( sK2 = sK5
| sP0
| sP0_iProver_def ),
inference(superposition,[status(thm)],[c_505,c_508]) ).
cnf(c_729,plain,
( ~ f(X0)
| ~ sP0
| X0 = sK3 ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
cnf(c_747,plain,
( ~ sP0
| ~ sP0_iProver_def ),
inference(superposition,[status(thm)],[c_53,c_503]) ).
cnf(c_749,plain,
( ~ sP0_iProver_def
| sP0 ),
inference(superposition,[status(thm)],[c_507,c_503]) ).
cnf(c_754,plain,
~ sP0_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_749,c_747]) ).
cnf(c_756,plain,
( sK1 != sK2
| sP0 ),
inference(backward_subsumption_resolution,[status(thm)],[c_506,c_754]) ).
cnf(c_899,plain,
( sK4(sK3) != sK3
| ~ f(sK3)
| ~ sP0 ),
inference(instantiation,[status(thm)],[c_510]) ).
cnf(c_948,plain,
( sK1 != X0
| sK2 != X0
| sK1 = sK2 ),
inference(instantiation,[status(thm)],[c_513]) ).
cnf(c_974,plain,
( sK1 != sK5
| sK2 != sK5
| sK1 = sK2 ),
inference(instantiation,[status(thm)],[c_948]) ).
cnf(c_978,plain,
sP0,
inference(global_subsumption_just,[status(thm)],[c_756,c_506,c_693,c_709,c_754,c_974]) ).
cnf(c_988,plain,
( ~ f(X0)
| f(sK4(X0)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_509,c_978]) ).
cnf(c_990,plain,
f(sK3),
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_978]) ).
cnf(c_1035,plain,
( ~ f(X0)
| X0 = sK3 ),
inference(global_subsumption_just,[status(thm)],[c_729,c_506,c_693,c_709,c_729,c_754,c_974]) ).
cnf(c_1043,plain,
( ~ f(X0)
| sK4(X0) = sK3 ),
inference(superposition,[status(thm)],[c_988,c_1035]) ).
cnf(c_1055,plain,
sK4(sK3) = sK3,
inference(superposition,[status(thm)],[c_990,c_1043]) ).
cnf(c_1059,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1055,c_978,c_899,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SYN415+1 : TPTP v8.1.2. Released v2.0.0.
% 0.05/0.12 % Command : run_iprover %s %d THM
% 0.10/0.33 % Computer : n022.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Thu May 2 20:55:27 EDT 2024
% 0.10/0.33 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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
% 2.17/1.13 % SZS status Started for theBenchmark.p
% 2.17/1.13 % SZS status Theorem for theBenchmark.p
% 2.17/1.13
% 2.17/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.17/1.13
% 2.17/1.13 ------ iProver source info
% 2.17/1.13
% 2.17/1.13 git: date: 2024-05-02 19:28:25 +0000
% 2.17/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.17/1.13 git: non_committed_changes: false
% 2.17/1.13
% 2.17/1.13 ------ Parsing...
% 2.17/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.17/1.13
% 2.17/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.17/1.13
% 2.17/1.13 ------ Preprocessing... gs_s sp: 3 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.17/1.13
% 2.17/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.17/1.13 ------ Proving...
% 2.17/1.13 ------ Problem Properties
% 2.17/1.13
% 2.17/1.13
% 2.17/1.13 clauses 10
% 2.17/1.13 conjectures 4
% 2.17/1.13 EPR 8
% 2.17/1.13 Horn 5
% 2.17/1.13 unary 0
% 2.17/1.13 binary 3
% 2.17/1.13 lits 28
% 2.17/1.13 lits eq 4
% 2.17/1.13 fd_pure 0
% 2.17/1.13 fd_pseudo 0
% 2.17/1.13 fd_cond 1
% 2.17/1.13 fd_pseudo_cond 1
% 2.17/1.13 AC symbols 0
% 2.17/1.13
% 2.17/1.13 ------ Schedule dynamic 5 is on
% 2.17/1.13
% 2.17/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.17/1.13
% 2.17/1.13
% 2.17/1.13 ------
% 2.17/1.13 Current options:
% 2.17/1.13 ------
% 2.17/1.13
% 2.17/1.13
% 2.17/1.13
% 2.17/1.13
% 2.17/1.13 ------ Proving...
% 2.17/1.13
% 2.17/1.13
% 2.17/1.13 % SZS status Theorem for theBenchmark.p
% 2.17/1.13
% 2.17/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.17/1.13
% 2.17/1.13
%------------------------------------------------------------------------------