TSTP Solution File: REL051+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : REL051+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 : Thu Aug 31 13:41:10 EDT 2023
% Result : Satisfiable 265.46s 35.41s
% Output : Saturation 265.46s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : o(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] :
( ( o(X0,X1)
& X0 != X1 )
=> ~ o(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1,X2] :
( ( o(X1,X2)
& o(X0,X1) )
=> o(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0,X1] :
( ( o(X0,X1)
& X0 != X1 )
=> ( o(f(X0,X1),X1)
& o(X0,f(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X0,X1] :
( f(X0,X1) != X1
& f(X0,X1) != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f6,axiom,
! [X0,X1] :
( o(X1,X0)
| o(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
fof(f7,plain,
! [X0,X1] :
( ~ o(X1,X0)
| ~ o(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
! [X0,X1] :
( ~ o(X1,X0)
| ~ o(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0,X1,X2] :
( o(X0,X2)
| ~ o(X1,X2)
| ~ o(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f10,plain,
! [X0,X1,X2] :
( o(X0,X2)
| ~ o(X1,X2)
| ~ o(X0,X1) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ( o(f(X0,X1),X1)
& o(X0,f(X0,X1)) )
| ~ o(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
! [X0,X1] :
( ( o(f(X0,X1),X1)
& o(X0,f(X0,X1)) )
| ~ o(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0] : o(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1] :
( ~ o(X1,X0)
| ~ o(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X2,X0,X1] :
( o(X0,X2)
| ~ o(X1,X2)
| ~ o(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
! [X0,X1] :
( o(X0,f(X0,X1))
| ~ o(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
! [X0,X1] :
( o(f(X0,X1),X1)
| ~ o(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X0,X1] : f(X0,X1) != X0,
inference(cnf_transformation,[],[f5]) ).
fof(f19,plain,
! [X0,X1] : f(X0,X1) != X1,
inference(cnf_transformation,[],[f5]) ).
fof(f20,plain,
! [X0,X1] :
( o(X1,X0)
| o(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,plain,
o(X0,X0),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,plain,
( ~ o(X0,X1)
| ~ o(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_51,plain,
( ~ o(X0,X1)
| ~ o(X1,X2)
| o(X0,X2) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_52,plain,
( ~ o(X0,X1)
| X0 = X1
| o(f(X0,X1),X1) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_53,plain,
( ~ o(X0,X1)
| X0 = X1
| o(X0,f(X0,X1)) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_54,plain,
f(X0,X1) != X1,
inference(cnf_transformation,[],[f19]) ).
cnf(c_55,plain,
f(X0,X1) != X0,
inference(cnf_transformation,[],[f18]) ).
cnf(c_56,plain,
( o(X0,X1)
| o(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_95,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_24370,plain,
( ~ o(X0,X1)
| o(X0,X2)
| o(X2,X1) ),
inference(superposition,[status(thm)],[c_56,c_51]) ).
cnf(c_59343,plain,
( o(X0,X1)
| o(X1,X2)
| o(X2,X0) ),
inference(superposition,[status(thm)],[c_56,c_24370]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL051+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 19:04:02 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
% 265.46/35.41 % SZS status Started for theBenchmark.p
% 265.46/35.41 % SZS status Satisfiable for theBenchmark.p
% 265.46/35.41
% 265.46/35.41 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 265.46/35.41
% 265.46/35.41 ------ iProver source info
% 265.46/35.41
% 265.46/35.41 git: date: 2023-05-31 18:12:56 +0000
% 265.46/35.41 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 265.46/35.41 git: non_committed_changes: false
% 265.46/35.41 git: last_make_outside_of_git: false
% 265.46/35.41
% 265.46/35.41 ------ Parsing...
% 265.46/35.41 ------ Clausification by vclausify_rel & Parsing by iProver...
% 265.46/35.41
% 265.46/35.41 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 265.46/35.41
% 265.46/35.41 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 265.46/35.41
% 265.46/35.41 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 265.46/35.41 ------ Proving...
% 265.46/35.41 ------ Problem Properties
% 265.46/35.41
% 265.46/35.41
% 265.46/35.41 clauses 8
% 265.46/35.41 conjectures 0
% 265.46/35.41 EPR 4
% 265.46/35.41 Horn 5
% 265.46/35.41 unary 3
% 265.46/35.41 binary 1
% 265.46/35.41 lits 17
% 265.46/35.41 lits eq 5
% 265.46/35.41 fd_pure 0
% 265.46/35.41 fd_pseudo 0
% 265.46/35.41 fd_cond 0
% 265.46/35.41 fd_pseudo_cond 3
% 265.46/35.41 AC symbols 0
% 265.46/35.41
% 265.46/35.41 ------ Input Options Time Limit: Unbounded
% 265.46/35.41
% 265.46/35.41
% 265.46/35.41 ------
% 265.46/35.41 Current options:
% 265.46/35.41 ------
% 265.46/35.41
% 265.46/35.41
% 265.46/35.41
% 265.46/35.41
% 265.46/35.41 ------ Proving...
% 265.46/35.41
% 265.46/35.41
% 265.46/35.41 % SZS status Satisfiable for theBenchmark.p
% 265.46/35.41
% 265.46/35.41 % SZS output start Saturation for theBenchmark.p
% See solution above
% 265.46/35.41
% 265.46/35.41
%------------------------------------------------------------------------------