TSTP Solution File: MGT066+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MGT066+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 09:14:56 EDT 2023
% Result : Satisfiable 0.71s 1.23s
% Output : Saturation 0.71s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( smaller(X0,X1)
<=> greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_smaller) ).
fof(f4,axiom,
! [X0,X1] :
~ ( greater(X1,X0)
& greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',meaning_postulate_greater_strict) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( greater(X1,X2)
& greater(X0,X1) )
=> greater(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',meaning_postulate_greater_transitive) ).
fof(f6,axiom,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| smaller(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',meaning_postulate_greater_comparable) ).
fof(f7,plain,
! [X0,X1] :
( smaller(X0,X1)
=> greater(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f8,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ smaller(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f10,plain,
! [X0,X1,X2] :
( greater(X0,X2)
| ~ greater(X1,X2)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
! [X0,X1,X2] :
( greater(X0,X2)
| ~ greater(X1,X2)
| ~ greater(X0,X1) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ smaller(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
! [X2,X0,X1] :
( greater(X0,X2)
| ~ greater(X1,X2)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f15,plain,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| smaller(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
cnf(c_49,plain,
( ~ smaller(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_50,plain,
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(cnf_transformation,[],[f13]) ).
cnf(c_51,plain,
( ~ greater(X0,X1)
| ~ greater(X2,X0)
| greater(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_52,plain,
( X0 = X1
| greater(X0,X1)
| smaller(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_74,plain,
X0 = X0,
theory(equality) ).
cnf(c_75,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_76,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : MGT066+1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n006.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.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Aug 28 06:17:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.21/0.65 WARNING - Could not infer the problem pformat. Setting FOF as default
% 0.71/1.23 % SZS status Started for theBenchmark.p
% 0.71/1.23 % SZS status Satisfiable for theBenchmark.p
% 0.71/1.23
% 0.71/1.23 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.71/1.23
% 0.71/1.23 ------ iProver source info
% 0.71/1.23
% 0.71/1.23 git: date: 2023-05-31 18:12:56 +0000
% 0.71/1.23 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.71/1.23 git: non_committed_changes: false
% 0.71/1.23 git: last_make_outside_of_git: false
% 0.71/1.23
% 0.71/1.23 ------ Parsing...
% 0.71/1.23 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_eq
% 0.71/1.23
% 0.71/1.23
% 0.71/1.23 ------ Preprocessing... sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe_e sf_s rm: 3 0s sf_e pe_s pe_e
% 0.71/1.23
% 0.71/1.23 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.71/1.23 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.71/1.23 ------ Proving...
% 0.71/1.23 ------ Problem Properties
% 0.71/1.23
% 0.71/1.23
% 0.71/1.23 clauses 0
% 0.71/1.23 conjectures 0
% 0.71/1.23 EPR 0
% 0.71/1.23 Horn 0
% 0.71/1.23 unary 0
% 0.71/1.23 binary 0
% 0.71/1.23 lits 0
% 0.71/1.23 lits eq 0
% 0.71/1.23 fd_pure 0
% 0.71/1.23 fd_pseudo 0
% 0.71/1.23 fd_cond 0
% 0.71/1.23 fd_pseudo_cond 0
% 0.71/1.23 AC symbols 0
% 0.71/1.23
% 0.71/1.23 ------ Schedule EPR Horn non eq is on
% 0.71/1.23
% 0.71/1.23 ------ no conjectures: strip conj schedule
% 0.71/1.23
% 0.71/1.23 ------ no equalities: superposition off
% 0.71/1.23
% 0.71/1.23 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.71/1.23
% 0.71/1.23
% 0.71/1.23
% 0.71/1.23
% 0.71/1.23 % SZS status Satisfiable for theBenchmark.p
% 0.71/1.23
% 0.71/1.23 % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.71/1.23
% 0.71/1.23
%------------------------------------------------------------------------------