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