TSTP Solution File: SYO645+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYO645+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:40:30 EDT 2023
% Result : Satisfiable 1.14s 1.19s
% Output : Saturation 1.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
( ? [X2] :
( ! [X4] :
( ! [X6] :
( f(X0,X4,X6)
| ! [X7] : f(X6,X2,X7) )
| ! [X5] : ~ f(X4,X2,X5) )
& ! [X3] : f(X2,X3,X0) )
& ? [X1] :
( ~ f(X0,X1,X0)
& ~ f(X0,X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,plain,
? [X0] :
( ? [X1] :
( ! [X2] :
( ! [X3] :
( f(X0,X2,X3)
| ! [X4] : f(X3,X1,X4) )
| ! [X5] : ~ f(X2,X1,X5) )
& ! [X6] : f(X1,X6,X0) )
& ? [X7] :
( ~ f(X0,X7,X0)
& ~ f(X0,X0,X7) ) ),
inference(rectify,[],[f1]) ).
fof(f3,plain,
( ? [X0] :
( ? [X1] :
( ! [X2] :
( ! [X3] :
( f(X0,X2,X3)
| ! [X4] : f(X3,X1,X4) )
| ! [X5] : ~ f(X2,X1,X5) )
& ! [X6] : f(X1,X6,X0) )
& ? [X7] :
( ~ f(X0,X7,X0)
& ~ f(X0,X0,X7) ) )
=> ( ? [X1] :
( ! [X2] :
( ! [X3] :
( f(sK0,X2,X3)
| ! [X4] : f(X3,X1,X4) )
| ! [X5] : ~ f(X2,X1,X5) )
& ! [X6] : f(X1,X6,sK0) )
& ? [X7] :
( ~ f(sK0,X7,sK0)
& ~ f(sK0,sK0,X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f4,plain,
( ? [X1] :
( ! [X2] :
( ! [X3] :
( f(sK0,X2,X3)
| ! [X4] : f(X3,X1,X4) )
| ! [X5] : ~ f(X2,X1,X5) )
& ! [X6] : f(X1,X6,sK0) )
=> ( ! [X2] :
( ! [X3] :
( f(sK0,X2,X3)
| ! [X4] : f(X3,sK1,X4) )
| ! [X5] : ~ f(X2,sK1,X5) )
& ! [X6] : f(sK1,X6,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ? [X7] :
( ~ f(sK0,X7,sK0)
& ~ f(sK0,sK0,X7) )
=> ( ~ f(sK0,sK2,sK0)
& ~ f(sK0,sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X2] :
( ! [X3] :
( f(sK0,X2,X3)
| ! [X4] : f(X3,sK1,X4) )
| ! [X5] : ~ f(X2,sK1,X5) )
& ! [X6] : f(sK1,X6,sK0)
& ~ f(sK0,sK2,sK0)
& ~ f(sK0,sK0,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f2,f5,f4,f3]) ).
fof(f7,plain,
~ f(sK0,sK0,sK2),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
~ f(sK0,sK2,sK0),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X6] : f(sK1,X6,sK0),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X3,X4,X5] :
( f(sK0,X2,X3)
| f(X3,sK1,X4)
| ~ f(X2,sK1,X5) ),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,plain,
( ~ f(X0,sK1,X1)
| f(X2,sK1,X3)
| f(sK0,X0,X2) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_50,plain,
f(sK1,X0,sK0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_51,plain,
~ f(sK0,sK2,sK0),
inference(cnf_transformation,[],[f8]) ).
cnf(c_52,plain,
~ f(sK0,sK0,sK2),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYO645+1 : TPTP v8.1.2. Released v7.2.0.
% 0.00/0.15 % Command : run_iprover %s %d THM
% 0.16/0.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sat Aug 26 07:45:45 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.14/1.19 % SZS status Started for theBenchmark.p
% 1.14/1.19 % SZS status Satisfiable for theBenchmark.p
% 1.14/1.19
% 1.14/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.14/1.19
% 1.14/1.19 ------ iProver source info
% 1.14/1.19
% 1.14/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.14/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.14/1.19 git: non_committed_changes: false
% 1.14/1.19 git: last_make_outside_of_git: false
% 1.14/1.19
% 1.14/1.19 ------ Parsing...
% 1.14/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 1.14/1.19
% 1.14/1.19
% 1.14/1.19 ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.14/1.19
% 1.14/1.19 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.14/1.19 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.14/1.19 ------ Proving...
% 1.14/1.19 ------ Problem Properties
% 1.14/1.19
% 1.14/1.19
% 1.14/1.19 clauses 0
% 1.14/1.19 conjectures 0
% 1.14/1.19 EPR 0
% 1.14/1.19 Horn 0
% 1.14/1.19 unary 0
% 1.14/1.19 binary 0
% 1.14/1.19 lits 0
% 1.14/1.19 lits eq 0
% 1.14/1.19 fd_pure 0
% 1.14/1.19 fd_pseudo 0
% 1.14/1.19 fd_cond 0
% 1.14/1.19 fd_pseudo_cond 0
% 1.14/1.19 AC symbols 0
% 1.14/1.19
% 1.14/1.19 ------ Schedule EPR Horn non eq is on
% 1.14/1.19
% 1.14/1.19 ------ no conjectures: strip conj schedule
% 1.14/1.19
% 1.14/1.19 ------ no equalities: superposition off
% 1.14/1.19
% 1.14/1.19 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 1.14/1.19
% 1.14/1.19
% 1.14/1.19
% 1.14/1.19
% 1.14/1.19 % SZS status Satisfiable for theBenchmark.p
% 1.14/1.19
% 1.14/1.19 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.14/1.19
% 1.14/1.19
%------------------------------------------------------------------------------