TSTP Solution File: MGT049+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MGT049+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:47 EDT 2023
% Result : Theorem 0.80s 1.16s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 6 unt; 0 def)
% Number of atoms : 65 ( 29 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 61 ( 21 ~; 12 |; 16 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 8 sgn; 33 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X3,X4] :
( organization(X0)
=> ( ( external_ties(X0,X4) = external_ties(X0,X3)
=> position(X0,X4) = position(X0,X3) )
& ( greater(external_ties(X0,X4),external_ties(X0,X3))
=> greater(position(X0,X4),position(X0,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_6) ).
fof(f8,axiom,
! [X0,X3,X4] :
( organization(X0)
=> external_ties(X0,X4) = external_ties(X0,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_11) ).
fof(f9,conjecture,
! [X0,X3,X4] :
( ( greater(age(X0,X4),age(X0,X3))
& organization(X0) )
=> position(X0,X4) = position(X0,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_6) ).
fof(f10,negated_conjecture,
~ ! [X0,X3,X4] :
( ( greater(age(X0,X4),age(X0,X3))
& organization(X0) )
=> position(X0,X4) = position(X0,X3) ),
inference(negated_conjecture,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2] :
( organization(X0)
=> ( ( external_ties(X0,X2) = external_ties(X0,X1)
=> position(X0,X2) = position(X0,X1) )
& ( greater(external_ties(X0,X2),external_ties(X0,X1))
=> greater(position(X0,X2),position(X0,X1)) ) ) ),
inference(rectify,[],[f7]) ).
fof(f12,plain,
! [X0,X1,X2] :
( organization(X0)
=> external_ties(X0,X2) = external_ties(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f13,plain,
~ ! [X0,X1,X2] :
( ( greater(age(X0,X2),age(X0,X1))
& organization(X0) )
=> position(X0,X2) = position(X0,X1) ),
inference(rectify,[],[f10]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( ( position(X0,X2) = position(X0,X1)
| external_ties(X0,X2) != external_ties(X0,X1) )
& ( greater(position(X0,X2),position(X0,X1))
| ~ greater(external_ties(X0,X2),external_ties(X0,X1)) ) )
| ~ organization(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f20,plain,
! [X0,X1,X2] :
( external_ties(X0,X2) = external_ties(X0,X1)
| ~ organization(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f21,plain,
? [X0,X1,X2] :
( position(X0,X2) != position(X0,X1)
& greater(age(X0,X2),age(X0,X1))
& organization(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f22,plain,
? [X0,X1,X2] :
( position(X0,X2) != position(X0,X1)
& greater(age(X0,X2),age(X0,X1))
& organization(X0) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
( ? [X0,X1,X2] :
( position(X0,X2) != position(X0,X1)
& greater(age(X0,X2),age(X0,X1))
& organization(X0) )
=> ( position(sK0,sK2) != position(sK0,sK1)
& greater(age(sK0,sK2),age(sK0,sK1))
& organization(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
( position(sK0,sK2) != position(sK0,sK1)
& greater(age(sK0,sK2),age(sK0,sK1))
& organization(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f22,f23]) ).
fof(f30,plain,
! [X2,X0,X1] :
( position(X0,X2) = position(X0,X1)
| external_ties(X0,X2) != external_ties(X0,X1)
| ~ organization(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
! [X2,X0,X1] :
( external_ties(X0,X2) = external_ties(X0,X1)
| ~ organization(X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f32,plain,
organization(sK0),
inference(cnf_transformation,[],[f24]) ).
fof(f34,plain,
position(sK0,sK2) != position(sK0,sK1),
inference(cnf_transformation,[],[f24]) ).
cnf(c_53,plain,
( external_ties(X0,X1) != external_ties(X0,X2)
| ~ organization(X0)
| position(X0,X1) = position(X0,X2) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_55,plain,
( ~ organization(X0)
| external_ties(X0,X1) = external_ties(X0,X2) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_56,negated_conjecture,
position(sK0,sK2) != position(sK0,sK1),
inference(cnf_transformation,[],[f34]) ).
cnf(c_58,negated_conjecture,
organization(sK0),
inference(cnf_transformation,[],[f32]) ).
cnf(c_65,plain,
( ~ organization(X0)
| position(X0,X1) = position(X0,X2) ),
inference(global_subsumption_just,[status(thm)],[c_53,c_55,c_53]) ).
cnf(c_162,plain,
( X0 != sK0
| position(X0,X1) = position(X0,X2) ),
inference(resolution_lifted,[status(thm)],[c_65,c_58]) ).
cnf(c_163,plain,
position(sK0,X0) = position(sK0,X1),
inference(unflattening,[status(thm)],[c_162]) ).
cnf(c_184,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : MGT049+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.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 : Mon Aug 28 06:44:41 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
% 0.80/1.16 % SZS status Started for theBenchmark.p
% 0.80/1.16 % SZS status Theorem for theBenchmark.p
% 0.80/1.16
% 0.80/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.80/1.16
% 0.80/1.16 ------ iProver source info
% 0.80/1.16
% 0.80/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.80/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.80/1.16 git: non_committed_changes: false
% 0.80/1.16 git: last_make_outside_of_git: false
% 0.80/1.16
% 0.80/1.16 ------ Parsing...
% 0.80/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.80/1.16
% 0.80/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s
% 0.80/1.16
% 0.80/1.16 % SZS status Theorem for theBenchmark.p
% 0.80/1.16
% 0.80/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.80/1.16
% 0.80/1.16
%------------------------------------------------------------------------------