TSTP Solution File: SYO693+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYO693+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:01 EDT 2023
% Result : Satisfiable 179.53s 24.80s
% Output : Saturation 179.53s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
( ~ f(X0,X0)
& ? [X1] :
( f(X1,X1)
& ~ f(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
? [X0] :
! [X2] :
( ~ f(X2,X2)
| f(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f3,axiom,
! [X2] :
? [X0] :
( ~ f(X2,X0)
& ? [X1] : f(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f4,axiom,
! [X2] :
? [X0] :
( f(X0,X0)
& ~ f(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f5,axiom,
! [X2,X3,X4] :
( ~ f(X2,X4)
| f(X3,X4)
| f(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f6,axiom,
! [X2,X3] :
( ! [X4] :
( f(X2,X4)
| ~ f(X3,X4) )
| ~ f(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f7,plain,
? [X0] :
! [X1] :
( ~ f(X1,X1)
| f(X0,X1) ),
inference(rectify,[],[f2]) ).
fof(f8,plain,
! [X0] :
? [X1] :
( ~ f(X0,X1)
& ? [X2] : f(X2,X1) ),
inference(rectify,[],[f3]) ).
fof(f9,plain,
! [X0] :
? [X1] :
( f(X1,X1)
& ~ f(X1,X0) ),
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] :
( ~ f(X0,X0)
& ? [X1] :
( f(X1,X1)
& ~ f(X0,X1) ) )
=> ( ~ f(sK0,sK0)
& ? [X1] :
( f(X1,X1)
& ~ f(sK0,X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X1] :
( f(X1,X1)
& ~ f(sK0,X1) )
=> ( f(sK1,sK1)
& ~ f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ~ f(sK0,sK0)
& f(sK1,sK1)
& ~ f(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f1,f13,f12]) ).
fof(f15,plain,
( ? [X0] :
! [X1] :
( ~ f(X1,X1)
| f(X0,X1) )
=> ! [X1] :
( ~ f(X1,X1)
| f(sK2,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X1] :
( ~ f(X1,X1)
| f(sK2,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f7,f15]) ).
fof(f17,plain,
! [X0] :
( ? [X1] :
( ~ f(X0,X1)
& ? [X2] : f(X2,X1) )
=> ( ~ f(X0,sK3(X0))
& ? [X2] : f(X2,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0] :
( ? [X2] : f(X2,sK3(X0))
=> f(sK4(X0),sK3(X0)) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0] :
( ~ f(X0,sK3(X0))
& f(sK4(X0),sK3(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f8,f18,f17]) ).
fof(f20,plain,
! [X0] :
( ? [X1] :
( f(X1,X1)
& ~ f(X1,X0) )
=> ( f(sK5(X0),sK5(X0))
& ~ f(sK5(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0] :
( f(sK5(X0),sK5(X0))
& ~ f(sK5(X0),X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f9,f20]) ).
fof(f22,plain,
~ f(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
f(sK1,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
~ f(sK0,sK0),
inference(cnf_transformation,[],[f14]) ).
fof(f25,plain,
! [X1] :
( ~ f(X1,X1)
| f(sK2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
! [X0] : f(sK4(X0),sK3(X0)),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
! [X0] : ~ f(X0,sK3(X0)),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
! [X0] : ~ f(sK5(X0),X0),
inference(cnf_transformation,[],[f21]) ).
fof(f29,plain,
! [X0] : f(sK5(X0),sK5(X0)),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ f(X0,X2)
| f(X1,X2)
| f(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f31,plain,
! [X2,X0,X1] :
( f(X0,X2)
| ~ f(X1,X2)
| ~ f(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_49,plain,
~ f(sK0,sK0),
inference(cnf_transformation,[],[f24]) ).
cnf(c_50,plain,
f(sK1,sK1),
inference(cnf_transformation,[],[f23]) ).
cnf(c_51,plain,
~ f(sK0,sK1),
inference(cnf_transformation,[],[f22]) ).
cnf(c_52,plain,
( ~ f(X0,X0)
| f(sK2,X0) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_53,plain,
~ f(X0,sK3(X0)),
inference(cnf_transformation,[],[f27]) ).
cnf(c_54,plain,
f(sK4(X0),sK3(X0)),
inference(cnf_transformation,[],[f26]) ).
cnf(c_55,plain,
f(sK5(X0),sK5(X0)),
inference(cnf_transformation,[],[f29]) ).
cnf(c_56,plain,
~ f(sK5(X0),X0),
inference(cnf_transformation,[],[f28]) ).
cnf(c_57,plain,
( ~ f(X0,X1)
| f(X0,X2)
| f(X2,X1) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_58,plain,
( ~ f(X0,X1)
| ~ f(X2,X0)
| f(X2,X1) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO693+1 : TPTP v8.1.2. Released v7.4.0.
% 0.13/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n031.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 25 23:24:37 EDT 2023
% 0.13/0.34 % 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
% 179.53/24.80 % SZS status Started for theBenchmark.p
% 179.53/24.80 % SZS status Satisfiable for theBenchmark.p
% 179.53/24.80
% 179.53/24.80 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 179.53/24.80
% 179.53/24.80 ------ iProver source info
% 179.53/24.80
% 179.53/24.80 git: date: 2023-05-31 18:12:56 +0000
% 179.53/24.80 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 179.53/24.80 git: non_committed_changes: false
% 179.53/24.80 git: last_make_outside_of_git: false
% 179.53/24.80
% 179.53/24.80 ------ Parsing...
% 179.53/24.80 ------ Clausification by vclausify_rel & Parsing by iProver...
% 179.53/24.80
% 179.53/24.80 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 179.53/24.80
% 179.53/24.80 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 179.53/24.80 ------ Proving...
% 179.53/24.80 ------ Problem Properties
% 179.53/24.80
% 179.53/24.80
% 179.53/24.80 clauses 10
% 179.53/24.80 conjectures 0
% 179.53/24.80 EPR 6
% 179.53/24.80 Horn 9
% 179.53/24.80 unary 7
% 179.53/24.80 binary 1
% 179.53/24.80 lits 15
% 179.53/24.80 lits eq 0
% 179.53/24.80 fd_pure 0
% 179.53/24.80 fd_pseudo 0
% 179.53/24.80 fd_cond 0
% 179.53/24.80 fd_pseudo_cond 0
% 179.53/24.80 AC symbols 0
% 179.53/24.80
% 179.53/24.80 ------ Input Options Time Limit: Unbounded
% 179.53/24.80
% 179.53/24.80
% 179.53/24.80 ------
% 179.53/24.80 Current options:
% 179.53/24.80 ------
% 179.53/24.80
% 179.53/24.80
% 179.53/24.80
% 179.53/24.80
% 179.53/24.80 ------ Proving...
% 179.53/24.80
% 179.53/24.80
% 179.53/24.80 % SZS status Satisfiable for theBenchmark.p
% 179.53/24.80
% 179.53/24.80 % SZS output start Saturation for theBenchmark.p
% See solution above
% 179.53/24.80
% 179.53/24.80
%------------------------------------------------------------------------------