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