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