TSTP Solution File: SYN076+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN076+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:05:09 EDT 2023
% Result : CounterSatisfiable 230.91s 30.94s
% Output : Saturation 230.91s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0,X1] :
( ! [X2] :
( X1 = X2
| X0 = X2 )
& X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel53_1) ).
fof(f2,conjecture,
( ? [X2] :
! [X0] :
( ? [X3] :
! [X1] :
( big_f(X0,X1)
<=> X1 = X3 )
<=> X0 = X2 )
<=> ? [X4] :
! [X5] :
( ? [X6] :
! [X7] :
( big_f(X7,X5)
<=> X6 = X7 )
<=> X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel53) ).
fof(f3,negated_conjecture,
~ ( ? [X2] :
! [X0] :
( ? [X3] :
! [X1] :
( big_f(X0,X1)
<=> X1 = X3 )
<=> X0 = X2 )
<=> ? [X4] :
! [X5] :
( ? [X6] :
! [X7] :
( big_f(X7,X5)
<=> X6 = X7 )
<=> X4 = X5 ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
~ ( ? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X1,X3)
<=> X2 = X3 )
<=> X0 = X1 )
<=> ? [X4] :
! [X5] :
( ? [X6] :
! [X7] :
( big_f(X7,X5)
<=> X6 = X7 )
<=> X4 = X5 ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
( ? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X1,X3)
<=> X2 = X3 )
<=> X0 = X1 )
<~> ? [X4] :
! [X5] :
( ? [X6] :
! [X7] :
( big_f(X7,X5)
<=> X6 = X7 )
<=> X4 = X5 ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
( sP0
<=> ? [X0] :
! [X1] :
( ? [X2] :
! [X3] :
( big_f(X1,X3)
<=> X2 = X3 )
<=> X0 = X1 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f7,plain,
( sP0
<~> ? [X4] :
! [X5] :
( ? [X6] :
! [X7] :
( big_f(X7,X5)
<=> X6 = X7 )
<=> X4 = X5 ) ),
inference(definition_folding,[],[f5,f6]) ).
fof(f8,plain,
( ? [X0,X1] :
( ! [X2] :
( X1 = X2
| X0 = X2 )
& X0 != X1 )
=> ( ! [X2] :
( sK2 = X2
| sK1 = X2 )
& sK1 != sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ! [X2] :
( sK2 = X2
| sK1 = X2 )
& sK1 != sK2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f1,f8]) ).
fof(f10,plain,
( ( sP0
| ! [X0] :
? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X1,X3) )
& ( X2 = X3
| big_f(X1,X3) ) ) )
& ( X0 = X1
| ? [X2] :
! [X3] :
( ( big_f(X1,X3)
| X2 != X3 )
& ( X2 = X3
| ~ big_f(X1,X3) ) ) ) ) )
& ( ? [X0] :
! [X1] :
( ( ? [X2] :
! [X3] :
( ( big_f(X1,X3)
| X2 != X3 )
& ( X2 = X3
| ~ big_f(X1,X3) ) )
| X0 != X1 )
& ( X0 = X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X1,X3) )
& ( X2 = X3
| big_f(X1,X3) ) ) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f11,plain,
( ( sP0
| ! [X0] :
? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X1,X3) )
& ( X2 = X3
| big_f(X1,X3) ) ) )
& ( X0 = X1
| ? [X4] :
! [X5] :
( ( big_f(X1,X5)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X1,X5) ) ) ) ) )
& ( ? [X6] :
! [X7] :
( ( ? [X8] :
! [X9] :
( ( big_f(X7,X9)
| X8 != X9 )
& ( X8 = X9
| ~ big_f(X7,X9) ) )
| X6 != X7 )
& ( X6 = X7
| ! [X10] :
? [X11] :
( ( X10 != X11
| ~ big_f(X7,X11) )
& ( X10 = X11
| big_f(X7,X11) ) ) ) )
| ~ sP0 ) ),
inference(rectify,[],[f10]) ).
fof(f12,plain,
! [X0] :
( ? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X1,X3) )
& ( X2 = X3
| big_f(X1,X3) ) ) )
& ( X0 = X1
| ? [X4] :
! [X5] :
( ( big_f(X1,X5)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X1,X5) ) ) ) )
=> ( ( sK3(X0) != X0
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(sK3(X0),X3) )
& ( X2 = X3
| big_f(sK3(X0),X3) ) ) )
& ( sK3(X0) = X0
| ? [X4] :
! [X5] :
( ( big_f(sK3(X0),X5)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(sK3(X0),X5) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X2] :
( ? [X3] :
( ( X2 != X3
| ~ big_f(sK3(X0),X3) )
& ( X2 = X3
| big_f(sK3(X0),X3) ) )
=> ( ( sK4(X0,X2) != X2
| ~ big_f(sK3(X0),sK4(X0,X2)) )
& ( sK4(X0,X2) = X2
| big_f(sK3(X0),sK4(X0,X2)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X0] :
( ? [X4] :
! [X5] :
( ( big_f(sK3(X0),X5)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(sK3(X0),X5) ) )
=> ! [X5] :
( ( big_f(sK3(X0),X5)
| sK5(X0) != X5 )
& ( sK5(X0) = X5
| ~ big_f(sK3(X0),X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X6] :
! [X7] :
( ( ? [X8] :
! [X9] :
( ( big_f(X7,X9)
| X8 != X9 )
& ( X8 = X9
| ~ big_f(X7,X9) ) )
| X6 != X7 )
& ( X6 = X7
| ! [X10] :
? [X11] :
( ( X10 != X11
| ~ big_f(X7,X11) )
& ( X10 = X11
| big_f(X7,X11) ) ) ) )
=> ! [X7] :
( ( ? [X8] :
! [X9] :
( ( big_f(X7,X9)
| X8 != X9 )
& ( X8 = X9
| ~ big_f(X7,X9) ) )
| sK6 != X7 )
& ( sK6 = X7
| ! [X10] :
? [X11] :
( ( X10 != X11
| ~ big_f(X7,X11) )
& ( X10 = X11
| big_f(X7,X11) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X7] :
( ? [X8] :
! [X9] :
( ( big_f(X7,X9)
| X8 != X9 )
& ( X8 = X9
| ~ big_f(X7,X9) ) )
=> ! [X9] :
( ( big_f(X7,X9)
| sK7(X7) != X9 )
& ( sK7(X7) = X9
| ~ big_f(X7,X9) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X7,X10] :
( ? [X11] :
( ( X10 != X11
| ~ big_f(X7,X11) )
& ( X10 = X11
| big_f(X7,X11) ) )
=> ( ( sK8(X7,X10) != X10
| ~ big_f(X7,sK8(X7,X10)) )
& ( sK8(X7,X10) = X10
| big_f(X7,sK8(X7,X10)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ( sP0
| ! [X0] :
( ( sK3(X0) != X0
| ! [X2] :
( ( sK4(X0,X2) != X2
| ~ big_f(sK3(X0),sK4(X0,X2)) )
& ( sK4(X0,X2) = X2
| big_f(sK3(X0),sK4(X0,X2)) ) ) )
& ( sK3(X0) = X0
| ! [X5] :
( ( big_f(sK3(X0),X5)
| sK5(X0) != X5 )
& ( sK5(X0) = X5
| ~ big_f(sK3(X0),X5) ) ) ) ) )
& ( ! [X7] :
( ( ! [X9] :
( ( big_f(X7,X9)
| sK7(X7) != X9 )
& ( sK7(X7) = X9
| ~ big_f(X7,X9) ) )
| sK6 != X7 )
& ( sK6 = X7
| ! [X10] :
( ( sK8(X7,X10) != X10
| ~ big_f(X7,sK8(X7,X10)) )
& ( sK8(X7,X10) = X10
| big_f(X7,sK8(X7,X10)) ) ) ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8])],[f11,f17,f16,f15,f14,f13,f12]) ).
fof(f19,plain,
( ( ! [X4] :
? [X5] :
( ( X4 != X5
| ! [X6] :
? [X7] :
( ( X6 != X7
| ~ big_f(X7,X5) )
& ( X6 = X7
| big_f(X7,X5) ) ) )
& ( X4 = X5
| ? [X6] :
! [X7] :
( ( big_f(X7,X5)
| X6 != X7 )
& ( X6 = X7
| ~ big_f(X7,X5) ) ) ) )
| ~ sP0 )
& ( ? [X4] :
! [X5] :
( ( ? [X6] :
! [X7] :
( ( big_f(X7,X5)
| X6 != X7 )
& ( X6 = X7
| ~ big_f(X7,X5) ) )
| X4 != X5 )
& ( X4 = X5
| ! [X6] :
? [X7] :
( ( X6 != X7
| ~ big_f(X7,X5) )
& ( X6 = X7
| big_f(X7,X5) ) ) ) )
| sP0 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f20,plain,
( ( ! [X0] :
? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) ) )
& ( X0 = X1
| ? [X4] :
! [X5] :
( ( big_f(X5,X1)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,X1) ) ) ) )
| ~ sP0 )
& ( ? [X6] :
! [X7] :
( ( ? [X8] :
! [X9] :
( ( big_f(X9,X7)
| X8 != X9 )
& ( X8 = X9
| ~ big_f(X9,X7) ) )
| X6 != X7 )
& ( X6 = X7
| ! [X10] :
? [X11] :
( ( X10 != X11
| ~ big_f(X11,X7) )
& ( X10 = X11
| big_f(X11,X7) ) ) ) )
| sP0 ) ),
inference(rectify,[],[f19]) ).
fof(f21,plain,
! [X0] :
( ? [X1] :
( ( X0 != X1
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) ) )
& ( X0 = X1
| ? [X4] :
! [X5] :
( ( big_f(X5,X1)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,X1) ) ) ) )
=> ( ( sK9(X0) != X0
| ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK9(X0)) )
& ( X2 = X3
| big_f(X3,sK9(X0)) ) ) )
& ( sK9(X0) = X0
| ? [X4] :
! [X5] :
( ( big_f(X5,sK9(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK9(X0)) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X2] :
( ? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK9(X0)) )
& ( X2 = X3
| big_f(X3,sK9(X0)) ) )
=> ( ( sK10(X0,X2) != X2
| ~ big_f(sK10(X0,X2),sK9(X0)) )
& ( sK10(X0,X2) = X2
| big_f(sK10(X0,X2),sK9(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0] :
( ? [X4] :
! [X5] :
( ( big_f(X5,sK9(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK9(X0)) ) )
=> ! [X5] :
( ( big_f(X5,sK9(X0))
| sK11(X0) != X5 )
& ( sK11(X0) = X5
| ~ big_f(X5,sK9(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
( ? [X6] :
! [X7] :
( ( ? [X8] :
! [X9] :
( ( big_f(X9,X7)
| X8 != X9 )
& ( X8 = X9
| ~ big_f(X9,X7) ) )
| X6 != X7 )
& ( X6 = X7
| ! [X10] :
? [X11] :
( ( X10 != X11
| ~ big_f(X11,X7) )
& ( X10 = X11
| big_f(X11,X7) ) ) ) )
=> ! [X7] :
( ( ? [X8] :
! [X9] :
( ( big_f(X9,X7)
| X8 != X9 )
& ( X8 = X9
| ~ big_f(X9,X7) ) )
| sK12 != X7 )
& ( sK12 = X7
| ! [X10] :
? [X11] :
( ( X10 != X11
| ~ big_f(X11,X7) )
& ( X10 = X11
| big_f(X11,X7) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X7] :
( ? [X8] :
! [X9] :
( ( big_f(X9,X7)
| X8 != X9 )
& ( X8 = X9
| ~ big_f(X9,X7) ) )
=> ! [X9] :
( ( big_f(X9,X7)
| sK13(X7) != X9 )
& ( sK13(X7) = X9
| ~ big_f(X9,X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X7,X10] :
( ? [X11] :
( ( X10 != X11
| ~ big_f(X11,X7) )
& ( X10 = X11
| big_f(X11,X7) ) )
=> ( ( sK14(X7,X10) != X10
| ~ big_f(sK14(X7,X10),X7) )
& ( sK14(X7,X10) = X10
| big_f(sK14(X7,X10),X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
( ( ! [X0] :
( ( sK9(X0) != X0
| ! [X2] :
( ( sK10(X0,X2) != X2
| ~ big_f(sK10(X0,X2),sK9(X0)) )
& ( sK10(X0,X2) = X2
| big_f(sK10(X0,X2),sK9(X0)) ) ) )
& ( sK9(X0) = X0
| ! [X5] :
( ( big_f(X5,sK9(X0))
| sK11(X0) != X5 )
& ( sK11(X0) = X5
| ~ big_f(X5,sK9(X0)) ) ) ) )
| ~ sP0 )
& ( ! [X7] :
( ( ! [X9] :
( ( big_f(X9,X7)
| sK13(X7) != X9 )
& ( sK13(X7) = X9
| ~ big_f(X9,X7) ) )
| sK12 != X7 )
& ( sK12 = X7
| ! [X10] :
( ( sK14(X7,X10) != X10
| ~ big_f(sK14(X7,X10),X7) )
& ( sK14(X7,X10) = X10
| big_f(sK14(X7,X10),X7) ) ) ) )
| sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13,sK14])],[f20,f26,f25,f24,f23,f22,f21]) ).
fof(f28,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f9]) ).
fof(f29,plain,
! [X2] :
( sK2 = X2
| sK1 = X2 ),
inference(cnf_transformation,[],[f9]) ).
fof(f30,plain,
! [X10,X7] :
( sK6 = X7
| sK8(X7,X10) = X10
| big_f(X7,sK8(X7,X10))
| ~ sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X10,X7] :
( sK6 = X7
| sK8(X7,X10) != X10
| ~ big_f(X7,sK8(X7,X10))
| ~ sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X9,X7] :
( sK7(X7) = X9
| ~ big_f(X7,X9)
| sK6 != X7
| ~ sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
! [X9,X7] :
( big_f(X7,X9)
| sK7(X7) != X9
| sK6 != X7
| ~ sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
! [X0,X5] :
( sP0
| sK3(X0) = X0
| sK5(X0) = X5
| ~ big_f(sK3(X0),X5) ),
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
! [X0,X5] :
( sP0
| sK3(X0) = X0
| big_f(sK3(X0),X5)
| sK5(X0) != X5 ),
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
! [X2,X0] :
( sP0
| sK3(X0) != X0
| sK4(X0,X2) = X2
| big_f(sK3(X0),sK4(X0,X2)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f37,plain,
! [X2,X0] :
( sP0
| sK3(X0) != X0
| sK4(X0,X2) != X2
| ~ big_f(sK3(X0),sK4(X0,X2)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
! [X10,X7] :
( sK12 = X7
| sK14(X7,X10) = X10
| big_f(sK14(X7,X10),X7)
| sP0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f39,plain,
! [X10,X7] :
( sK12 = X7
| sK14(X7,X10) != X10
| ~ big_f(sK14(X7,X10),X7)
| sP0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f40,plain,
! [X9,X7] :
( sK13(X7) = X9
| ~ big_f(X9,X7)
| sK12 != X7
| sP0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f41,plain,
! [X9,X7] :
( big_f(X9,X7)
| sK13(X7) != X9
| sK12 != X7
| sP0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f42,plain,
! [X0,X5] :
( sK9(X0) = X0
| sK11(X0) = X5
| ~ big_f(X5,sK9(X0))
| ~ sP0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f43,plain,
! [X0,X5] :
( sK9(X0) = X0
| big_f(X5,sK9(X0))
| sK11(X0) != X5
| ~ sP0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
! [X2,X0] :
( sK9(X0) != X0
| sK10(X0,X2) = X2
| big_f(sK10(X0,X2),sK9(X0))
| ~ sP0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f45,plain,
! [X2,X0] :
( sK9(X0) != X0
| sK10(X0,X2) != X2
| ~ big_f(sK10(X0,X2),sK9(X0))
| ~ sP0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f46,plain,
! [X0] :
( sP0
| sK3(X0) = X0
| big_f(sK3(X0),sK5(X0)) ),
inference(equality_resolution,[],[f35]) ).
fof(f47,plain,
! [X7] :
( big_f(X7,sK7(X7))
| sK6 != X7
| ~ sP0 ),
inference(equality_resolution,[],[f33]) ).
fof(f48,plain,
( big_f(sK6,sK7(sK6))
| ~ sP0 ),
inference(equality_resolution,[],[f47]) ).
fof(f49,plain,
! [X9] :
( sK7(sK6) = X9
| ~ big_f(sK6,X9)
| ~ sP0 ),
inference(equality_resolution,[],[f32]) ).
fof(f50,plain,
! [X0] :
( sK9(X0) = X0
| big_f(sK11(X0),sK9(X0))
| ~ sP0 ),
inference(equality_resolution,[],[f43]) ).
fof(f51,plain,
! [X7] :
( big_f(sK13(X7),X7)
| sK12 != X7
| sP0 ),
inference(equality_resolution,[],[f41]) ).
fof(f52,plain,
( big_f(sK13(sK12),sK12)
| sP0 ),
inference(equality_resolution,[],[f51]) ).
fof(f53,plain,
! [X9] :
( sK13(sK12) = X9
| ~ big_f(X9,sK12)
| sP0 ),
inference(equality_resolution,[],[f40]) ).
cnf(c_49,plain,
( X0 = sK2
| X0 = sK1 ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_50,plain,
sK2 != sK1,
inference(cnf_transformation,[],[f28]) ).
cnf(c_51,plain,
( sK4(X0,X1) != X1
| sK3(X0) != X0
| ~ big_f(sK3(X0),sK4(X0,X1))
| sP0 ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_52,plain,
( sK3(X0) != X0
| sK4(X0,X1) = X1
| big_f(sK3(X0),sK4(X0,X1))
| sP0 ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_53,plain,
( sK3(X0) = X0
| big_f(sK3(X0),sK5(X0))
| sP0 ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_54,plain,
( ~ big_f(sK3(X0),X1)
| sK3(X0) = X0
| sK5(X0) = X1
| sP0 ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_55,plain,
( ~ sP0
| big_f(sK6,sK7(sK6)) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_56,plain,
( ~ big_f(sK6,X0)
| ~ sP0
| sK7(sK6) = X0 ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_57,plain,
( sK8(X0,X1) != X1
| ~ big_f(X0,sK8(X0,X1))
| ~ sP0
| X0 = sK6 ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_58,plain,
( ~ sP0
| sK8(X0,X1) = X1
| X0 = sK6
| big_f(X0,sK8(X0,X1)) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_59,negated_conjecture,
( sK10(X0,X1) != X1
| sK9(X0) != X0
| ~ big_f(sK10(X0,X1),sK9(X0))
| ~ sP0 ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_60,negated_conjecture,
( sK9(X0) != X0
| ~ sP0
| sK10(X0,X1) = X1
| big_f(sK10(X0,X1),sK9(X0)) ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_61,negated_conjecture,
( ~ sP0
| sK9(X0) = X0
| big_f(sK11(X0),sK9(X0)) ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_62,negated_conjecture,
( ~ big_f(X0,sK9(X1))
| ~ sP0
| sK9(X1) = X1
| sK11(X1) = X0 ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_63,negated_conjecture,
( big_f(sK13(sK12),sK12)
| sP0 ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_64,negated_conjecture,
( ~ big_f(X0,sK12)
| sK13(sK12) = X0
| sP0 ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_65,negated_conjecture,
( sK14(X0,X1) != X1
| ~ big_f(sK14(X0,X1),X0)
| X0 = sK12
| sP0 ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_66,negated_conjecture,
( sK14(X0,X1) = X1
| X0 = sK12
| big_f(sK14(X0,X1),X0)
| sP0 ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_201,plain,
X0_1 = X0_1,
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN076+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Aug 26 18:47:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 230.91/30.94 % SZS status Started for theBenchmark.p
% 230.91/30.94 % SZS status CounterSatisfiable for theBenchmark.p
% 230.91/30.94
% 230.91/30.94 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 230.91/30.94
% 230.91/30.94 ------ iProver source info
% 230.91/30.94
% 230.91/30.94 git: date: 2023-05-31 18:12:56 +0000
% 230.91/30.94 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 230.91/30.94 git: non_committed_changes: false
% 230.91/30.94 git: last_make_outside_of_git: false
% 230.91/30.94
% 230.91/30.94 ------ Parsing...
% 230.91/30.94 ------ Clausification by vclausify_rel & Parsing by iProver...
% 230.91/30.94
% 230.91/30.94 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 230.91/30.94
% 230.91/30.94 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 230.91/30.94
% 230.91/30.94 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 230.91/30.94 ------ Proving...
% 230.91/30.94 ------ Problem Properties
% 230.91/30.94
% 230.91/30.94
% 230.91/30.94 clauses 18
% 230.91/30.94 conjectures 8
% 230.91/30.94 EPR 2
% 230.91/30.94 Horn 6
% 230.91/30.94 unary 1
% 230.91/30.94 binary 3
% 230.91/30.94 lits 59
% 230.91/30.94 lits eq 27
% 230.91/30.94 fd_pure 1
% 230.91/30.94 fd_pseudo 0
% 230.91/30.94 fd_cond 4
% 230.91/30.94 fd_pseudo_cond 0
% 230.91/30.94 AC symbols 0
% 230.91/30.94
% 230.91/30.94 ------ Input Options Time Limit: Unbounded
% 230.91/30.94
% 230.91/30.94
% 230.91/30.94 ------
% 230.91/30.94 Current options:
% 230.91/30.94 ------
% 230.91/30.94
% 230.91/30.94
% 230.91/30.94
% 230.91/30.94
% 230.91/30.94 ------ Proving...
% 230.91/30.94
% 230.91/30.94
% 230.91/30.94 % SZS status CounterSatisfiable for theBenchmark.p
% 230.91/30.94
% 230.91/30.94 % SZS output start Saturation for theBenchmark.p
% See solution above
% 230.91/30.94
% 230.91/30.95
%------------------------------------------------------------------------------