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