TSTP Solution File: MGT049+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT049+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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:08:40 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 25 ( 4 unt; 11 typ; 0 def)
% Number of atoms : 35 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 33 ( 12 ~; 9 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 6 sgn; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
smaller_or_equal: ( $i * $i ) > $o ).
tff(decl_23,type,
smaller: ( $i * $i ) > $o ).
tff(decl_24,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(decl_25,type,
greater: ( $i * $i ) > $o ).
tff(decl_26,type,
organization: $i > $o ).
tff(decl_27,type,
external_ties: ( $i * $i ) > $i ).
tff(decl_28,type,
position: ( $i * $i ) > $i ).
tff(decl_29,type,
age: ( $i * $i ) > $i ).
tff(decl_30,type,
esk1_0: $i ).
tff(decl_31,type,
esk2_0: $i ).
tff(decl_32,type,
esk3_0: $i ).
fof(assumption_6,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( greater(external_ties(X1,X5),external_ties(X1,X4))
=> greater(position(X1,X5),position(X1,X4)) )
& ( external_ties(X1,X5) = external_ties(X1,X4)
=> position(X1,X5) = position(X1,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6) ).
fof(assumption_11,axiom,
! [X1,X4,X5] :
( organization(X1)
=> external_ties(X1,X5) = external_ties(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_11) ).
fof(lemma_6,conjecture,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> position(X1,X5) = position(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_6) ).
fof(c_0_3,plain,
! [X19,X20,X21] :
( ( ~ greater(external_ties(X19,X21),external_ties(X19,X20))
| greater(position(X19,X21),position(X19,X20))
| ~ organization(X19) )
& ( external_ties(X19,X21) != external_ties(X19,X20)
| position(X19,X21) = position(X19,X20)
| ~ organization(X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_6])])]) ).
fof(c_0_4,plain,
! [X22,X23,X24] :
( ~ organization(X22)
| external_ties(X22,X24) = external_ties(X22,X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_11])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> position(X1,X5) = position(X1,X4) ),
inference(assume_negation,[status(cth)],[lemma_6]) ).
cnf(c_0_6,plain,
( position(X1,X2) = position(X1,X3)
| external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( organization(esk1_0)
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& position(esk1_0,esk3_0) != position(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1) ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
position(esk1_0,esk3_0) != position(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
position(esk1_0,X1) = position(esk1_0,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT049+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Mon Aug 28 06:37:01 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.006000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.009000 s
%------------------------------------------------------------------------------