TSTP Solution File: SYO793+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYO793+1 : TPTP v8.1.2. Released v7.4.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 Sep 1 04:41:25 EDT 2023
% Result : Satisfiable 264.98s 35.40s
% Output : Saturation 264.98s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
( ! [X6] :
( f(X6,X0)
| ~ f(X6,X6) )
& ? [X1] :
( ~ f(X1,X0)
& ? [X2] :
( f(X1,X2)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
? [X0] :
( f(X0,X0)
& ? [X2] :
( ~ f(X2,X0)
& ? [X5] :
( f(X2,X5)
& ? [X8] :
( f(X5,X8)
& ? [X9] :
( ~ f(X9,X8)
& ? [X10] : f(X9,X10) ) ) ) )
& ? [X1] :
( f(X1,X1)
& ? [X4] :
( ~ f(X4,X1)
& ? [X7] :
( ~ f(X7,X4)
& ~ f(X0,X7) ) )
& ? [X3] :
( f(X3,X3)
& ~ f(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f3,axiom,
? [X0] :
! [X6] :
( ! [X11] : ~ f(X6,X11)
| f(X6,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f4,axiom,
! [X6] :
? [X0] :
( ~ f(X6,X0)
& ? [X1] : f(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f5,axiom,
! [X6] :
? [X0] :
( ~ f(X6,X0)
& f(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f6,axiom,
! [X6,X11,X12] :
( ~ f(X6,X12)
| f(X11,X12)
| f(X6,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f7,axiom,
! [X6,X11] :
( ! [X12] :
( f(X6,X12)
| ~ f(X11,X12) )
| ~ f(X6,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f8,axiom,
! [X6] :
( f(X6,X6)
| ! [X12] :
( ~ f(X12,X12)
| f(X6,X12) )
| ! [X11] :
( ~ f(X11,X11)
| f(X11,X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f9,plain,
? [X0] :
( ! [X1] :
( f(X1,X0)
| ~ f(X1,X1) )
& ? [X2] :
( ~ f(X2,X0)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( f(X3,X4)
& ? [X5] :
( ~ f(X5,X4)
& ? [X6] : f(X5,X6) ) ) ) ) ),
inference(rectify,[],[f1]) ).
fof(f10,plain,
? [X0] :
( f(X0,X0)
& ? [X1] :
( ~ f(X1,X0)
& ? [X2] :
( f(X1,X2)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) ) ) )
& ? [X6] :
( f(X6,X6)
& ? [X7] :
( ~ f(X7,X6)
& ? [X8] :
( ~ f(X8,X7)
& ~ f(X0,X8) ) )
& ? [X9] :
( f(X9,X9)
& ~ f(X6,X9) ) ) ),
inference(rectify,[],[f2]) ).
fof(f11,plain,
? [X0] :
! [X1] :
( ! [X2] : ~ f(X1,X2)
| f(X1,X0) ),
inference(rectify,[],[f3]) ).
fof(f12,plain,
! [X0] :
? [X1] :
( ~ f(X0,X1)
& ? [X2] : f(X2,X1) ),
inference(rectify,[],[f4]) ).
fof(f13,plain,
! [X0] :
? [X1] :
( ~ f(X0,X1)
& f(X1,X1) ),
inference(rectify,[],[f5]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ~ f(X0,X2)
| f(X1,X2)
| f(X0,X1) ),
inference(rectify,[],[f6]) ).
fof(f15,plain,
! [X0,X1] :
( ! [X2] :
( f(X0,X2)
| ~ f(X1,X2) )
| ~ f(X0,X1) ),
inference(rectify,[],[f7]) ).
fof(f16,plain,
! [X0] :
( f(X0,X0)
| ! [X1] :
( ~ f(X1,X1)
| f(X0,X1) )
| ! [X2] :
( ~ f(X2,X2)
| f(X2,X0) ) ),
inference(rectify,[],[f8]) ).
fof(f17,plain,
( ? [X0] :
( ! [X1] :
( f(X1,X0)
| ~ f(X1,X1) )
& ? [X2] :
( ~ f(X2,X0)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( f(X3,X4)
& ? [X5] :
( ~ f(X5,X4)
& ? [X6] : f(X5,X6) ) ) ) ) )
=> ( ! [X1] :
( f(X1,sK0)
| ~ f(X1,X1) )
& ? [X2] :
( ~ f(X2,sK0)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( f(X3,X4)
& ? [X5] :
( ~ f(X5,X4)
& ? [X6] : f(X5,X6) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ? [X2] :
( ~ f(X2,sK0)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( f(X3,X4)
& ? [X5] :
( ~ f(X5,X4)
& ? [X6] : f(X5,X6) ) ) ) )
=> ( ~ f(sK1,sK0)
& ? [X3] :
( f(sK1,X3)
& ? [X4] :
( f(X3,X4)
& ? [X5] :
( ~ f(X5,X4)
& ? [X6] : f(X5,X6) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ? [X3] :
( f(sK1,X3)
& ? [X4] :
( f(X3,X4)
& ? [X5] :
( ~ f(X5,X4)
& ? [X6] : f(X5,X6) ) ) )
=> ( f(sK1,sK2)
& ? [X4] :
( f(sK2,X4)
& ? [X5] :
( ~ f(X5,X4)
& ? [X6] : f(X5,X6) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
( ? [X4] :
( f(sK2,X4)
& ? [X5] :
( ~ f(X5,X4)
& ? [X6] : f(X5,X6) ) )
=> ( f(sK2,sK3)
& ? [X5] :
( ~ f(X5,sK3)
& ? [X6] : f(X5,X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ? [X5] :
( ~ f(X5,sK3)
& ? [X6] : f(X5,X6) )
=> ( ~ f(sK4,sK3)
& ? [X6] : f(sK4,X6) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( ? [X6] : f(sK4,X6)
=> f(sK4,sK5) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
( ! [X1] :
( f(X1,sK0)
| ~ f(X1,X1) )
& ~ f(sK1,sK0)
& f(sK1,sK2)
& f(sK2,sK3)
& ~ f(sK4,sK3)
& f(sK4,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f9,f22,f21,f20,f19,f18,f17]) ).
fof(f24,plain,
( ? [X0] :
( f(X0,X0)
& ? [X1] :
( ~ f(X1,X0)
& ? [X2] :
( f(X1,X2)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) ) ) )
& ? [X6] :
( f(X6,X6)
& ? [X7] :
( ~ f(X7,X6)
& ? [X8] :
( ~ f(X8,X7)
& ~ f(X0,X8) ) )
& ? [X9] :
( f(X9,X9)
& ~ f(X6,X9) ) ) )
=> ( f(sK6,sK6)
& ? [X1] :
( ~ f(X1,sK6)
& ? [X2] :
( f(X1,X2)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) ) ) )
& ? [X6] :
( f(X6,X6)
& ? [X7] :
( ~ f(X7,X6)
& ? [X8] :
( ~ f(X8,X7)
& ~ f(sK6,X8) ) )
& ? [X9] :
( f(X9,X9)
& ~ f(X6,X9) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
( ? [X1] :
( ~ f(X1,sK6)
& ? [X2] :
( f(X1,X2)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) ) ) )
=> ( ~ f(sK7,sK6)
& ? [X2] :
( f(sK7,X2)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( ? [X2] :
( f(sK7,X2)
& ? [X3] :
( f(X2,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) ) )
=> ( f(sK7,sK8)
& ? [X3] :
( f(sK8,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
( ? [X3] :
( f(sK8,X3)
& ? [X4] :
( ~ f(X4,X3)
& ? [X5] : f(X4,X5) ) )
=> ( f(sK8,sK9)
& ? [X4] :
( ~ f(X4,sK9)
& ? [X5] : f(X4,X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
( ? [X4] :
( ~ f(X4,sK9)
& ? [X5] : f(X4,X5) )
=> ( ~ f(sK10,sK9)
& ? [X5] : f(sK10,X5) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( ? [X5] : f(sK10,X5)
=> f(sK10,sK11) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
( ? [X6] :
( f(X6,X6)
& ? [X7] :
( ~ f(X7,X6)
& ? [X8] :
( ~ f(X8,X7)
& ~ f(sK6,X8) ) )
& ? [X9] :
( f(X9,X9)
& ~ f(X6,X9) ) )
=> ( f(sK12,sK12)
& ? [X7] :
( ~ f(X7,sK12)
& ? [X8] :
( ~ f(X8,X7)
& ~ f(sK6,X8) ) )
& ? [X9] :
( f(X9,X9)
& ~ f(sK12,X9) ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
( ? [X7] :
( ~ f(X7,sK12)
& ? [X8] :
( ~ f(X8,X7)
& ~ f(sK6,X8) ) )
=> ( ~ f(sK13,sK12)
& ? [X8] :
( ~ f(X8,sK13)
& ~ f(sK6,X8) ) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
( ? [X8] :
( ~ f(X8,sK13)
& ~ f(sK6,X8) )
=> ( ~ f(sK14,sK13)
& ~ f(sK6,sK14) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
( ? [X9] :
( f(X9,X9)
& ~ f(sK12,X9) )
=> ( f(sK15,sK15)
& ~ f(sK12,sK15) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
( f(sK6,sK6)
& ~ f(sK7,sK6)
& f(sK7,sK8)
& f(sK8,sK9)
& ~ f(sK10,sK9)
& f(sK10,sK11)
& f(sK12,sK12)
& ~ f(sK13,sK12)
& ~ f(sK14,sK13)
& ~ f(sK6,sK14)
& f(sK15,sK15)
& ~ f(sK12,sK15) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15])],[f10,f33,f32,f31,f30,f29,f28,f27,f26,f25,f24]) ).
fof(f35,plain,
( ? [X0] :
! [X1] :
( ! [X2] : ~ f(X1,X2)
| f(X1,X0) )
=> ! [X1] :
( ! [X2] : ~ f(X1,X2)
| f(X1,sK16) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X1] :
( ! [X2] : ~ f(X1,X2)
| f(X1,sK16) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK16])],[f11,f35]) ).
fof(f37,plain,
! [X0] :
( ? [X1] :
( ~ f(X0,X1)
& ? [X2] : f(X2,X1) )
=> ( ~ f(X0,sK17(X0))
& ? [X2] : f(X2,sK17(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0] :
( ? [X2] : f(X2,sK17(X0))
=> f(sK18(X0),sK17(X0)) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
! [X0] :
( ~ f(X0,sK17(X0))
& f(sK18(X0),sK17(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17,sK18])],[f12,f38,f37]) ).
fof(f40,plain,
! [X0] :
( ? [X1] :
( ~ f(X0,X1)
& f(X1,X1) )
=> ( ~ f(X0,sK19(X0))
& f(sK19(X0),sK19(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0] :
( ~ f(X0,sK19(X0))
& f(sK19(X0),sK19(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f13,f40]) ).
fof(f42,plain,
f(sK4,sK5),
inference(cnf_transformation,[],[f23]) ).
fof(f43,plain,
~ f(sK4,sK3),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
f(sK2,sK3),
inference(cnf_transformation,[],[f23]) ).
fof(f45,plain,
f(sK1,sK2),
inference(cnf_transformation,[],[f23]) ).
fof(f46,plain,
~ f(sK1,sK0),
inference(cnf_transformation,[],[f23]) ).
fof(f47,plain,
! [X1] :
( f(X1,sK0)
| ~ f(X1,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f48,plain,
~ f(sK12,sK15),
inference(cnf_transformation,[],[f34]) ).
fof(f49,plain,
f(sK15,sK15),
inference(cnf_transformation,[],[f34]) ).
fof(f50,plain,
~ f(sK6,sK14),
inference(cnf_transformation,[],[f34]) ).
fof(f51,plain,
~ f(sK14,sK13),
inference(cnf_transformation,[],[f34]) ).
fof(f52,plain,
~ f(sK13,sK12),
inference(cnf_transformation,[],[f34]) ).
fof(f53,plain,
f(sK12,sK12),
inference(cnf_transformation,[],[f34]) ).
fof(f54,plain,
f(sK10,sK11),
inference(cnf_transformation,[],[f34]) ).
fof(f55,plain,
~ f(sK10,sK9),
inference(cnf_transformation,[],[f34]) ).
fof(f56,plain,
f(sK8,sK9),
inference(cnf_transformation,[],[f34]) ).
fof(f57,plain,
f(sK7,sK8),
inference(cnf_transformation,[],[f34]) ).
fof(f58,plain,
~ f(sK7,sK6),
inference(cnf_transformation,[],[f34]) ).
fof(f59,plain,
f(sK6,sK6),
inference(cnf_transformation,[],[f34]) ).
fof(f60,plain,
! [X2,X1] :
( ~ f(X1,X2)
| f(X1,sK16) ),
inference(cnf_transformation,[],[f36]) ).
fof(f61,plain,
! [X0] : f(sK18(X0),sK17(X0)),
inference(cnf_transformation,[],[f39]) ).
fof(f62,plain,
! [X0] : ~ f(X0,sK17(X0)),
inference(cnf_transformation,[],[f39]) ).
fof(f63,plain,
! [X0] : f(sK19(X0),sK19(X0)),
inference(cnf_transformation,[],[f41]) ).
fof(f64,plain,
! [X0] : ~ f(X0,sK19(X0)),
inference(cnf_transformation,[],[f41]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ f(X0,X2)
| f(X1,X2)
| f(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f66,plain,
! [X2,X0,X1] :
( f(X0,X2)
| ~ f(X1,X2)
| ~ f(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f67,plain,
! [X2,X0,X1] :
( f(X0,X0)
| ~ f(X1,X1)
| f(X0,X1)
| ~ f(X2,X2)
| f(X2,X0) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_49,plain,
( ~ f(X0,X0)
| f(X0,sK0) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_50,plain,
~ f(sK1,sK0),
inference(cnf_transformation,[],[f46]) ).
cnf(c_51,plain,
f(sK1,sK2),
inference(cnf_transformation,[],[f45]) ).
cnf(c_52,plain,
f(sK2,sK3),
inference(cnf_transformation,[],[f44]) ).
cnf(c_53,plain,
~ f(sK4,sK3),
inference(cnf_transformation,[],[f43]) ).
cnf(c_54,plain,
f(sK4,sK5),
inference(cnf_transformation,[],[f42]) ).
cnf(c_55,plain,
f(sK6,sK6),
inference(cnf_transformation,[],[f59]) ).
cnf(c_56,plain,
~ f(sK7,sK6),
inference(cnf_transformation,[],[f58]) ).
cnf(c_57,plain,
f(sK7,sK8),
inference(cnf_transformation,[],[f57]) ).
cnf(c_58,plain,
f(sK8,sK9),
inference(cnf_transformation,[],[f56]) ).
cnf(c_59,plain,
~ f(sK10,sK9),
inference(cnf_transformation,[],[f55]) ).
cnf(c_60,plain,
f(sK10,sK11),
inference(cnf_transformation,[],[f54]) ).
cnf(c_61,plain,
f(sK12,sK12),
inference(cnf_transformation,[],[f53]) ).
cnf(c_62,plain,
~ f(sK13,sK12),
inference(cnf_transformation,[],[f52]) ).
cnf(c_63,plain,
~ f(sK14,sK13),
inference(cnf_transformation,[],[f51]) ).
cnf(c_64,plain,
~ f(sK6,sK14),
inference(cnf_transformation,[],[f50]) ).
cnf(c_65,plain,
f(sK15,sK15),
inference(cnf_transformation,[],[f49]) ).
cnf(c_66,plain,
~ f(sK12,sK15),
inference(cnf_transformation,[],[f48]) ).
cnf(c_67,plain,
( ~ f(X0,X1)
| f(X0,sK16) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_68,plain,
~ f(X0,sK17(X0)),
inference(cnf_transformation,[],[f62]) ).
cnf(c_69,plain,
f(sK18(X0),sK17(X0)),
inference(cnf_transformation,[],[f61]) ).
cnf(c_70,plain,
~ f(X0,sK19(X0)),
inference(cnf_transformation,[],[f64]) ).
cnf(c_71,plain,
f(sK19(X0),sK19(X0)),
inference(cnf_transformation,[],[f63]) ).
cnf(c_72,plain,
( ~ f(X0,X1)
| f(X0,X2)
| f(X2,X1) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_73,plain,
( ~ f(X0,X1)
| ~ f(X2,X0)
| f(X2,X1) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_74,plain,
( ~ f(X0,X0)
| ~ f(X1,X1)
| f(X1,X2)
| f(X2,X0)
| f(X2,X2) ),
inference(cnf_transformation,[],[f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYO793+1 : TPTP v8.1.2. Released v7.4.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 06:35:03 EDT 2023
% 0.13/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
% 264.98/35.40 % SZS status Started for theBenchmark.p
% 264.98/35.40 % SZS status Satisfiable for theBenchmark.p
% 264.98/35.40
% 264.98/35.40 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 264.98/35.40
% 264.98/35.40 ------ iProver source info
% 264.98/35.40
% 264.98/35.40 git: date: 2023-05-31 18:12:56 +0000
% 264.98/35.40 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 264.98/35.40 git: non_committed_changes: false
% 264.98/35.40 git: last_make_outside_of_git: false
% 264.98/35.40
% 264.98/35.40 ------ Parsing...
% 264.98/35.40 ------ Clausification by vclausify_rel & Parsing by iProver...
% 264.98/35.40
% 264.98/35.40 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 264.98/35.40
% 264.98/35.40 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 264.98/35.40 ------ Proving...
% 264.98/35.40 ------ Problem Properties
% 264.98/35.40
% 264.98/35.40
% 264.98/35.40 clauses 26
% 264.98/35.40 conjectures 0
% 264.98/35.40 EPR 22
% 264.98/35.40 Horn 24
% 264.98/35.40 unary 21
% 264.98/35.40 binary 2
% 264.98/35.40 lits 36
% 264.98/35.40 lits eq 0
% 264.98/35.40 fd_pure 0
% 264.98/35.40 fd_pseudo 0
% 264.98/35.40 fd_cond 0
% 264.98/35.40 fd_pseudo_cond 0
% 264.98/35.40 AC symbols 0
% 264.98/35.40
% 264.98/35.40 ------ Input Options Time Limit: Unbounded
% 264.98/35.40
% 264.98/35.40
% 264.98/35.40 ------
% 264.98/35.40 Current options:
% 264.98/35.40 ------
% 264.98/35.40
% 264.98/35.40
% 264.98/35.40
% 264.98/35.40
% 264.98/35.40 ------ Proving...
% 264.98/35.40
% 264.98/35.40
% 264.98/35.40 % SZS status Satisfiable for theBenchmark.p
% 264.98/35.40
% 264.98/35.40 % SZS output start Saturation for theBenchmark.p
% See solution above
% 264.98/35.40
% 264.98/35.42
%------------------------------------------------------------------------------