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