TSTP Solution File: SYO743+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYO743+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:12 EDT 2023
% Result : Satisfiable 203.15s 27.38s
% Output : Saturation 203.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0,X1] :
( ? [X2] :
( ~ f(X1,X2)
& f(X0,X2) )
& ~ f(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
? [X0] :
! [X3] :
( ~ f(X3,X0)
| ! [X4] : f(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f5,axiom,
! [X3] :
? [X0] :
( ! [X4] :
( f(X4,X0)
| ! [X5] :
( f(X0,X5)
| ~ f(X4,X5) ) )
& f(X3,X0)
& ? [X1] : ~ f(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f6,axiom,
! [X3] : f(X3,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f7,axiom,
! [X3,X4,X5] :
( f(X3,X5)
| ~ f(X4,X5)
| ~ f(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f11,plain,
? [X0] :
! [X1] :
( ~ f(X1,X0)
| ! [X2] : f(X1,X2) ),
inference(rectify,[],[f2]) ).
fof(f14,plain,
! [X0] :
? [X1] :
( ! [X2] :
( f(X2,X1)
| ! [X3] :
( f(X1,X3)
| ~ f(X2,X3) ) )
& f(X0,X1)
& ? [X4] : ~ f(X4,X1) ),
inference(rectify,[],[f5]) ).
fof(f15,plain,
! [X0] : f(X0,X0),
inference(rectify,[],[f6]) ).
fof(f16,plain,
! [X0,X1,X2] :
( f(X0,X2)
| ~ f(X1,X2)
| ~ f(X0,X1) ),
inference(rectify,[],[f7]) ).
fof(f20,plain,
( ? [X0,X1] :
( ? [X2] :
( ~ f(X1,X2)
& f(X0,X2) )
& ~ f(X0,X1) )
=> ( ? [X2] :
( ~ f(sK1,X2)
& f(sK0,X2) )
& ~ f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ? [X2] :
( ~ f(sK1,X2)
& f(sK0,X2) )
=> ( ~ f(sK1,sK2)
& f(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( ~ f(sK1,sK2)
& f(sK0,sK2)
& ~ f(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f1,f21,f20]) ).
fof(f23,plain,
( ? [X0] :
! [X1] :
( ~ f(X1,X0)
| ! [X2] : f(X1,X2) )
=> ! [X1] :
( ~ f(X1,sK3)
| ! [X2] : f(X1,X2) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X1] :
( ~ f(X1,sK3)
| ! [X2] : f(X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f11,f23]) ).
fof(f29,plain,
! [X0] :
( ? [X1] :
( ! [X2] :
( f(X2,X1)
| ! [X3] :
( f(X1,X3)
| ~ f(X2,X3) ) )
& f(X0,X1)
& ? [X4] : ~ f(X4,X1) )
=> ( ! [X2] :
( f(X2,sK6(X0))
| ! [X3] :
( f(sK6(X0),X3)
| ~ f(X2,X3) ) )
& f(X0,sK6(X0))
& ? [X4] : ~ f(X4,sK6(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0] :
( ? [X4] : ~ f(X4,sK6(X0))
=> ~ f(sK7(X0),sK6(X0)) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0] :
( ! [X2] :
( f(X2,sK6(X0))
| ! [X3] :
( f(sK6(X0),X3)
| ~ f(X2,X3) ) )
& f(X0,sK6(X0))
& ~ f(sK7(X0),sK6(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f14,f30,f29]) ).
fof(f32,plain,
~ f(sK0,sK1),
inference(cnf_transformation,[],[f22]) ).
fof(f33,plain,
f(sK0,sK2),
inference(cnf_transformation,[],[f22]) ).
fof(f34,plain,
~ f(sK1,sK2),
inference(cnf_transformation,[],[f22]) ).
fof(f35,plain,
! [X2,X1] :
( ~ f(X1,sK3)
| f(X1,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f38,plain,
! [X0] : ~ f(sK7(X0),sK6(X0)),
inference(cnf_transformation,[],[f31]) ).
fof(f39,plain,
! [X0] : f(X0,sK6(X0)),
inference(cnf_transformation,[],[f31]) ).
fof(f40,plain,
! [X2,X3,X0] :
( f(X2,sK6(X0))
| f(sK6(X0),X3)
| ~ f(X2,X3) ),
inference(cnf_transformation,[],[f31]) ).
fof(f41,plain,
! [X0] : f(X0,X0),
inference(cnf_transformation,[],[f15]) ).
fof(f42,plain,
! [X2,X0,X1] :
( f(X0,X2)
| ~ f(X1,X2)
| ~ f(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_49,plain,
~ f(sK1,sK2),
inference(cnf_transformation,[],[f34]) ).
cnf(c_50,plain,
f(sK0,sK2),
inference(cnf_transformation,[],[f33]) ).
cnf(c_51,plain,
~ f(sK0,sK1),
inference(cnf_transformation,[],[f32]) ).
cnf(c_52,plain,
( ~ f(X0,sK3)
| f(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_55,plain,
( ~ f(X0,X1)
| f(sK6(X2),X1)
| f(X0,sK6(X2)) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_56,plain,
f(X0,sK6(X0)),
inference(cnf_transformation,[],[f39]) ).
cnf(c_57,plain,
~ f(sK7(X0),sK6(X0)),
inference(cnf_transformation,[],[f38]) ).
cnf(c_58,plain,
f(X0,X0),
inference(cnf_transformation,[],[f41]) ).
cnf(c_59,plain,
( ~ f(X0,X1)
| ~ f(X2,X0)
| f(X2,X1) ),
inference(cnf_transformation,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO743+1 : TPTP v8.1.2. Released v7.4.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 07:05:25 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 203.15/27.38 % SZS status Started for theBenchmark.p
% 203.15/27.38 % SZS status Satisfiable for theBenchmark.p
% 203.15/27.38
% 203.15/27.38 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 203.15/27.38
% 203.15/27.38 ------ iProver source info
% 203.15/27.38
% 203.15/27.38 git: date: 2023-05-31 18:12:56 +0000
% 203.15/27.38 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 203.15/27.38 git: non_committed_changes: false
% 203.15/27.38 git: last_make_outside_of_git: false
% 203.15/27.38
% 203.15/27.38 ------ Parsing...
% 203.15/27.38 ------ Clausification by vclausify_rel & Parsing by iProver...
% 203.15/27.38
% 203.15/27.38 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 203.15/27.38
% 203.15/27.38 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 203.15/27.38 ------ Proving...
% 203.15/27.38 ------ Problem Properties
% 203.15/27.38
% 203.15/27.38
% 203.15/27.38 clauses 9
% 203.15/27.38 conjectures 0
% 203.15/27.38 EPR 6
% 203.15/27.38 Horn 8
% 203.15/27.38 unary 6
% 203.15/27.38 binary 1
% 203.15/27.38 lits 14
% 203.15/27.38 lits eq 0
% 203.15/27.38 fd_pure 0
% 203.15/27.38 fd_pseudo 0
% 203.15/27.38 fd_cond 0
% 203.15/27.38 fd_pseudo_cond 0
% 203.15/27.38 AC symbols 0
% 203.15/27.38
% 203.15/27.38 ------ Input Options Time Limit: Unbounded
% 203.15/27.38
% 203.15/27.38
% 203.15/27.38 ------
% 203.15/27.38 Current options:
% 203.15/27.38 ------
% 203.15/27.38
% 203.15/27.38
% 203.15/27.38
% 203.15/27.38
% 203.15/27.38 ------ Proving...
% 203.15/27.38
% 203.15/27.38
% 203.15/27.38 % SZS status Satisfiable for theBenchmark.p
% 203.15/27.38
% 203.15/27.38 % SZS output start Saturation for theBenchmark.p
% See solution above
% 203.15/27.38
% 203.15/27.38
%------------------------------------------------------------------------------