TSTP Solution File: SYO750+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYO750+1 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:14 EDT 2023
% Result : Satisfiable 213.09s 28.82s
% Output : Saturation 213.09s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
( ! [X1] :
( f(X0,X1)
| ! [X2] : ~ f(X2,X1) )
& ~ f(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
? [X0] :
( f(X0,X0)
& ! [X1] :
( ~ f(X1,X0)
| ! [X2] :
( f(X1,X2)
| ! [X3] : ~ f(X3,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f3,axiom,
? [X0] :
! [X1] :
( ~ f(X1,X1)
| f(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f4,axiom,
! [X1] :
? [X0] :
( ~ f(X0,X1)
& ? [X4] : f(X0,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f5,axiom,
! [X1,X2,X3] :
( ~ f(X1,X3)
| f(X2,X3)
| f(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f6,axiom,
! [X1,X2] :
( ! [X3] :
( f(X1,X3)
| ~ f(X2,X3) )
| ~ f(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f7,axiom,
! [X1] :
( ? [X0] :
( f(X0,X0)
& ~ f(X1,X0)
& ? [X4] :
( f(X4,X0)
& ? [X5] :
( ~ f(X4,X5)
& ? [X6] : f(X6,X5) ) ) )
| ! [X2] :
( f(X1,X2)
| ! [X3] : ~ f(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f8,axiom,
! [X1] :
( f(X1,X1)
| ! [X3] :
( ~ f(X3,X3)
| f(X1,X3) )
| ! [X2] :
( ~ f(X2,X2)
| f(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f9,plain,
! [X0] :
? [X1] :
( ~ f(X1,X0)
& ? [X2] : f(X1,X2) ),
inference(rectify,[],[f4]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ~ f(X0,X2)
| f(X1,X2)
| f(X0,X1) ),
inference(rectify,[],[f5]) ).
fof(f11,plain,
! [X0,X1] :
( ! [X2] :
( f(X0,X2)
| ~ f(X1,X2) )
| ~ f(X0,X1) ),
inference(rectify,[],[f6]) ).
fof(f12,plain,
! [X0] :
( ? [X1] :
( f(X1,X1)
& ~ f(X0,X1)
& ? [X2] :
( f(X2,X1)
& ? [X3] :
( ~ f(X2,X3)
& ? [X4] : f(X4,X3) ) ) )
| ! [X5] :
( f(X0,X5)
| ! [X6] : ~ f(X6,X5) ) ),
inference(rectify,[],[f7]) ).
fof(f13,plain,
! [X0] :
( f(X0,X0)
| ! [X1] :
( ~ f(X1,X1)
| f(X0,X1) )
| ! [X2] :
( ~ f(X2,X2)
| f(X2,X0) ) ),
inference(rectify,[],[f8]) ).
fof(f14,plain,
( ? [X0] :
( ! [X1] :
( f(X0,X1)
| ! [X2] : ~ f(X2,X1) )
& ~ f(X0,X0) )
=> ( ! [X1] :
( f(sK0,X1)
| ! [X2] : ~ f(X2,X1) )
& ~ f(sK0,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ! [X1] :
( f(sK0,X1)
| ! [X2] : ~ f(X2,X1) )
& ~ f(sK0,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f14]) ).
fof(f16,plain,
( ? [X0] :
( f(X0,X0)
& ! [X1] :
( ~ f(X1,X0)
| ! [X2] :
( f(X1,X2)
| ! [X3] : ~ f(X3,X2) ) ) )
=> ( f(sK1,sK1)
& ! [X1] :
( ~ f(X1,sK1)
| ! [X2] :
( f(X1,X2)
| ! [X3] : ~ f(X3,X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( f(sK1,sK1)
& ! [X1] :
( ~ f(X1,sK1)
| ! [X2] :
( f(X1,X2)
| ! [X3] : ~ f(X3,X2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f2,f16]) ).
fof(f18,plain,
( ? [X0] :
! [X1] :
( ~ f(X1,X1)
| f(X1,X0) )
=> ! [X1] :
( ~ f(X1,X1)
| f(X1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X1] :
( ~ f(X1,X1)
| f(X1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f3,f18]) ).
fof(f20,plain,
! [X0] :
( ? [X1] :
( ~ f(X1,X0)
& ? [X2] : f(X1,X2) )
=> ( ~ f(sK3(X0),X0)
& ? [X2] : f(sK3(X0),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0] :
( ? [X2] : f(sK3(X0),X2)
=> f(sK3(X0),sK4(X0)) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0] :
( ~ f(sK3(X0),X0)
& f(sK3(X0),sK4(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f9,f21,f20]) ).
fof(f23,plain,
! [X0] :
( ? [X1] :
( f(X1,X1)
& ~ f(X0,X1)
& ? [X2] :
( f(X2,X1)
& ? [X3] :
( ~ f(X2,X3)
& ? [X4] : f(X4,X3) ) ) )
=> ( f(sK5(X0),sK5(X0))
& ~ f(X0,sK5(X0))
& ? [X2] :
( f(X2,sK5(X0))
& ? [X3] :
( ~ f(X2,X3)
& ? [X4] : f(X4,X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0] :
( ? [X2] :
( f(X2,sK5(X0))
& ? [X3] :
( ~ f(X2,X3)
& ? [X4] : f(X4,X3) ) )
=> ( f(sK6(X0),sK5(X0))
& ? [X3] :
( ~ f(sK6(X0),X3)
& ? [X4] : f(X4,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0] :
( ? [X3] :
( ~ f(sK6(X0),X3)
& ? [X4] : f(X4,X3) )
=> ( ~ f(sK6(X0),sK7(X0))
& ? [X4] : f(X4,sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0] :
( ? [X4] : f(X4,sK7(X0))
=> f(sK8(X0),sK7(X0)) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0] :
( ( f(sK5(X0),sK5(X0))
& ~ f(X0,sK5(X0))
& f(sK6(X0),sK5(X0))
& ~ f(sK6(X0),sK7(X0))
& f(sK8(X0),sK7(X0)) )
| ! [X5] :
( f(X0,X5)
| ! [X6] : ~ f(X6,X5) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8])],[f12,f26,f25,f24,f23]) ).
fof(f28,plain,
~ f(sK0,sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X2,X1] :
( f(sK0,X1)
| ~ f(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X3,X1] :
( ~ f(X1,sK1)
| f(X1,X2)
| ~ f(X3,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f31,plain,
f(sK1,sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
! [X1] :
( ~ f(X1,X1)
| f(X1,sK2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X0] : f(sK3(X0),sK4(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f34,plain,
! [X0] : ~ f(sK3(X0),X0),
inference(cnf_transformation,[],[f22]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ f(X0,X2)
| f(X1,X2)
| f(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f36,plain,
! [X2,X0,X1] :
( f(X0,X2)
| ~ f(X1,X2)
| ~ f(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f37,plain,
! [X0,X6,X5] :
( f(sK8(X0),sK7(X0))
| f(X0,X5)
| ~ f(X6,X5) ),
inference(cnf_transformation,[],[f27]) ).
fof(f38,plain,
! [X0,X6,X5] :
( ~ f(sK6(X0),sK7(X0))
| f(X0,X5)
| ~ f(X6,X5) ),
inference(cnf_transformation,[],[f27]) ).
fof(f39,plain,
! [X0,X6,X5] :
( f(sK6(X0),sK5(X0))
| f(X0,X5)
| ~ f(X6,X5) ),
inference(cnf_transformation,[],[f27]) ).
fof(f40,plain,
! [X0,X6,X5] :
( ~ f(X0,sK5(X0))
| f(X0,X5)
| ~ f(X6,X5) ),
inference(cnf_transformation,[],[f27]) ).
fof(f41,plain,
! [X0,X6,X5] :
( f(sK5(X0),sK5(X0))
| f(X0,X5)
| ~ f(X6,X5) ),
inference(cnf_transformation,[],[f27]) ).
fof(f42,plain,
! [X2,X0,X1] :
( f(X0,X0)
| ~ f(X1,X1)
| f(X0,X1)
| ~ f(X2,X2)
| f(X2,X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_49,plain,
( ~ f(X0,X1)
| f(sK0,X1) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_50,plain,
~ f(sK0,sK0),
inference(cnf_transformation,[],[f28]) ).
cnf(c_51,plain,
f(sK1,sK1),
inference(cnf_transformation,[],[f31]) ).
cnf(c_52,plain,
( ~ f(X0,X1)
| ~ f(X2,sK1)
| f(X2,X1) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_53,plain,
( ~ f(X0,X0)
| f(X0,sK2) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_54,plain,
~ f(sK3(X0),X0),
inference(cnf_transformation,[],[f34]) ).
cnf(c_55,plain,
f(sK3(X0),sK4(X0)),
inference(cnf_transformation,[],[f33]) ).
cnf(c_56,plain,
( ~ f(X0,X1)
| f(X0,X2)
| f(X2,X1) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_57,plain,
( ~ f(X0,X1)
| ~ f(X2,X0)
| f(X2,X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_58,plain,
( ~ f(X0,X1)
| f(sK5(X2),sK5(X2))
| f(X2,X1) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_59,plain,
( ~ f(X0,sK5(X0))
| ~ f(X1,X2)
| f(X0,X2) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_60,plain,
( ~ f(X0,X1)
| f(sK6(X2),sK5(X2))
| f(X2,X1) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_61,plain,
( ~ f(sK6(X0),sK7(X0))
| ~ f(X1,X2)
| f(X0,X2) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_62,plain,
( ~ f(X0,X1)
| f(sK8(X2),sK7(X2))
| f(X2,X1) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_63,plain,
( ~ f(X0,X0)
| ~ f(X1,X1)
| f(X1,X2)
| f(X2,X0)
| f(X2,X2) ),
inference(cnf_transformation,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO750+1 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.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 03:45:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 213.09/28.82 % SZS status Started for theBenchmark.p
% 213.09/28.82 % SZS status Satisfiable for theBenchmark.p
% 213.09/28.82
% 213.09/28.82 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 213.09/28.82
% 213.09/28.82 ------ iProver source info
% 213.09/28.82
% 213.09/28.82 git: date: 2023-05-31 18:12:56 +0000
% 213.09/28.82 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 213.09/28.82 git: non_committed_changes: false
% 213.09/28.82 git: last_make_outside_of_git: false
% 213.09/28.82
% 213.09/28.82 ------ Parsing...
% 213.09/28.82 ------ Clausification by vclausify_rel & Parsing by iProver...
% 213.09/28.82
% 213.09/28.82 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 213.09/28.82
% 213.09/28.82 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 213.09/28.82 ------ Proving...
% 213.09/28.82 ------ Problem Properties
% 213.09/28.82
% 213.09/28.82
% 213.09/28.82 clauses 15
% 213.09/28.82 conjectures 0
% 213.09/28.82 EPR 8
% 213.09/28.82 Horn 10
% 213.09/28.82 unary 4
% 213.09/28.82 binary 2
% 213.09/28.82 lits 37
% 213.09/28.82 lits eq 0
% 213.09/28.82 fd_pure 0
% 213.09/28.82 fd_pseudo 0
% 213.09/28.82 fd_cond 0
% 213.09/28.82 fd_pseudo_cond 0
% 213.09/28.82 AC symbols 0
% 213.09/28.82
% 213.09/28.82 ------ Input Options Time Limit: Unbounded
% 213.09/28.82
% 213.09/28.82
% 213.09/28.82 ------
% 213.09/28.82 Current options:
% 213.09/28.82 ------
% 213.09/28.82
% 213.09/28.82
% 213.09/28.82
% 213.09/28.82
% 213.09/28.82 ------ Proving...
% 213.09/28.82
% 213.09/28.82
% 213.09/28.82 % SZS status Satisfiable for theBenchmark.p
% 213.09/28.82
% 213.09/28.82 % SZS output start Saturation for theBenchmark.p
% See solution above
% 213.09/28.82
% 213.09/28.83
%------------------------------------------------------------------------------