TSTP Solution File: MSC019+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MSC019+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:26:16 EDT 2023
% Result : Theorem 2.49s 1.16s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 13 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 9 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
s_contains(s_g019,s_g013),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kb18) ).
fof(f75,axiom,
s_contains(s_g013,s_MX),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kb74) ).
fof(f601,axiom,
! [X0,X1,X2] :
( ( s_contains(X1,X2)
& s_contains(X0,X1) )
=> s_contains(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1) ).
fof(f604,conjecture,
s_contains(s_g019,s_MX),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexico_in_america_1) ).
fof(f605,negated_conjecture,
~ s_contains(s_g019,s_MX),
inference(negated_conjecture,[],[f604]) ).
fof(f606,plain,
~ s_contains(s_g019,s_MX),
inference(flattening,[],[f605]) ).
fof(f607,plain,
! [X0,X1,X2] :
( s_contains(X0,X2)
| ~ s_contains(X1,X2)
| ~ s_contains(X0,X1) ),
inference(ennf_transformation,[],[f601]) ).
fof(f608,plain,
! [X0,X1,X2] :
( s_contains(X0,X2)
| ~ s_contains(X1,X2)
| ~ s_contains(X0,X1) ),
inference(flattening,[],[f607]) ).
fof(f629,plain,
s_contains(s_g019,s_g013),
inference(cnf_transformation,[],[f19]) ).
fof(f685,plain,
s_contains(s_g013,s_MX),
inference(cnf_transformation,[],[f75]) ).
fof(f1211,plain,
! [X2,X0,X1] :
( s_contains(X0,X2)
| ~ s_contains(X1,X2)
| ~ s_contains(X0,X1) ),
inference(cnf_transformation,[],[f608]) ).
fof(f1214,plain,
~ s_contains(s_g019,s_MX),
inference(cnf_transformation,[],[f606]) ).
cnf(c_67,plain,
s_contains(s_g019,s_g013),
inference(cnf_transformation,[],[f629]) ).
cnf(c_123,plain,
s_contains(s_g013,s_MX),
inference(cnf_transformation,[],[f685]) ).
cnf(c_649,plain,
( ~ s_contains(X0,X1)
| ~ s_contains(X1,X2)
| s_contains(X0,X2) ),
inference(cnf_transformation,[],[f1211]) ).
cnf(c_652,negated_conjecture,
~ s_contains(s_g019,s_MX),
inference(cnf_transformation,[],[f1214]) ).
cnf(c_1282,plain,
( ~ s_contains(s_g013,X0)
| s_contains(s_g019,X0) ),
inference(resolution,[status(thm)],[c_649,c_67]) ).
cnf(c_2019,plain,
s_contains(s_g019,s_MX),
inference(resolution,[status(thm)],[c_1282,c_123]) ).
cnf(c_2020,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2019,c_652]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC019+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n027.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 : Thu Aug 24 14:08:02 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.49/1.16 % SZS status Started for theBenchmark.p
% 2.49/1.16 % SZS status Theorem for theBenchmark.p
% 2.49/1.16
% 2.49/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.49/1.16
% 2.49/1.16 ------ iProver source info
% 2.49/1.16
% 2.49/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.49/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.49/1.16 git: non_committed_changes: false
% 2.49/1.16 git: last_make_outside_of_git: false
% 2.49/1.16
% 2.49/1.16 ------ Parsing...
% 2.49/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 2.49/1.16
% 2.49/1.16
% 2.49/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e sf_s rm: 0 0s sf_e
% 2.49/1.16
% 2.49/1.16 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 2.49/1.16 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.49/1.16 ------ Proving...
% 2.49/1.16 ------ Problem Properties
% 2.49/1.16
% 2.49/1.16
% 2.49/1.16 clauses 602
% 2.49/1.16 conjectures 1
% 2.49/1.16 EPR 602
% 2.49/1.16 Horn 602
% 2.49/1.16 unary 599
% 2.49/1.16 binary 2
% 2.49/1.16 lits 606
% 2.49/1.16 lits eq 0
% 2.49/1.16 fd_pure 0
% 2.49/1.16 fd_pseudo 0
% 2.49/1.16 fd_cond 0
% 2.49/1.16 fd_pseudo_cond 0
% 2.49/1.16 AC symbols 0
% 2.49/1.16
% 2.49/1.16 ------ Schedule EPR Horn non eq is on
% 2.49/1.16
% 2.49/1.16 ------ no equalities: superposition off
% 2.49/1.16
% 2.49/1.16 ------ Option_epr_horn Time Limit: Unbounded
% 2.49/1.16
% 2.49/1.16
% 2.49/1.16 ------
% 2.49/1.16 Current options:
% 2.49/1.16 ------
% 2.49/1.16
% 2.49/1.16
% 2.49/1.16
% 2.49/1.16
% 2.49/1.16 ------ Proving...
% 2.49/1.16
% 2.49/1.16
% 2.49/1.16 % SZS status Theorem for theBenchmark.p
% 2.49/1.16
% 2.49/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.49/1.16
% 2.49/1.16
%------------------------------------------------------------------------------