TSTP Solution File: MGT002-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT002-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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:07:11 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 23
% Syntax : Number of formulae : 45 ( 17 unt; 11 typ; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 122 ( 62 ~; 60 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 6 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 62 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
organization: ( $i * $i ) > $o ).
tff(decl_23,type,
sk1: ( $i * $i ) > $i ).
tff(decl_24,type,
reproducibility: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
reorganization_free: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
inertia: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
greater: ( $i * $i ) > $o ).
tff(decl_28,type,
sk2: $i ).
tff(decl_29,type,
sk5: $i ).
tff(decl_30,type,
sk6: $i ).
tff(decl_31,type,
sk3: $i ).
tff(decl_32,type,
sk4: $i ).
cnf(mp4_3,axiom,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_3) ).
cnf(t2_FOL_9,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_9) ).
cnf(a3_FOL_4,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reproducibility(X3,X6,X4)
| ~ inertia(X1,X7,X2)
| ~ inertia(X3,X8,X4)
| ~ greater(X6,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL_4) ).
cnf(t2_FOL_11,negated_conjecture,
inertia(sk2,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_11) ).
cnf(t2_FOL_8,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_8) ).
cnf(a4_FOL_6,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ greater(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4_FOL_6) ).
cnf(t2_FOL_12,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_12) ).
cnf(t2_FOL_7,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_7) ).
cnf(mp3_1,axiom,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_1) ).
cnf(mp4_2,axiom,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_2) ).
cnf(t2_FOL_10,negated_conjecture,
inertia(sk2,sk3,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_10) ).
cnf(t2_FOL_13,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_13) ).
cnf(c_0_12,axiom,
( reorganization_free(X1,X3,X3)
| ~ reorganization_free(X1,X2,X3) ),
mp4_3 ).
cnf(c_0_13,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
t2_FOL_9 ).
cnf(c_0_14,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ reproducibility(X1,X5,X2)
| ~ reproducibility(X3,X6,X4)
| ~ inertia(X1,X7,X2)
| ~ inertia(X3,X8,X4)
| ~ greater(X6,X5) ),
a3_FOL_4 ).
cnf(c_0_15,negated_conjecture,
inertia(sk2,sk4,sk6),
t2_FOL_11 ).
cnf(c_0_16,negated_conjecture,
reorganization_free(sk2,sk6,sk6),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
organization(sk2,sk6),
t2_FOL_8 ).
cnf(c_0_18,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ greater(X3,X2) ),
a4_FOL_6 ).
cnf(c_0_19,negated_conjecture,
greater(sk6,sk5),
t2_FOL_12 ).
cnf(c_0_20,negated_conjecture,
organization(sk2,sk5),
t2_FOL_7 ).
cnf(c_0_21,negated_conjecture,
( greater(sk4,X1)
| ~ greater(X2,X3)
| ~ inertia(X4,X1,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ reproducibility(sk2,X2,sk6)
| ~ reproducibility(X4,X3,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_22,axiom,
( reproducibility(X1,sk1(X2,X1),X2)
| ~ organization(X1,X2) ),
mp3_1 ).
cnf(c_0_23,negated_conjecture,
( greater(X1,X2)
| ~ reproducibility(sk2,X1,sk6)
| ~ reproducibility(sk2,X2,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_19]),c_0_17]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
( greater(sk4,X1)
| ~ greater(sk1(sk6,sk2),X2)
| ~ inertia(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ reproducibility(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
( greater(sk1(sk6,sk2),X1)
| ~ reproducibility(sk2,X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
( greater(sk4,X1)
| ~ inertia(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(sk2,X4,sk5)
| ~ reproducibility(X2,X4,X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
mp4_2 ).
cnf(c_0_28,negated_conjecture,
( greater(sk4,X1)
| ~ inertia(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X2,sk1(sk5,sk2),X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
reorganization_free(sk2,sk5,sk5),
inference(spm,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_30,negated_conjecture,
( greater(sk4,X1)
| ~ inertia(sk2,X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_22]),c_0_29]),c_0_20])]) ).
cnf(c_0_31,negated_conjecture,
inertia(sk2,sk3,sk5),
t2_FOL_10 ).
cnf(c_0_32,negated_conjecture,
~ greater(sk4,sk3),
t2_FOL_13 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT002-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n024.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:35:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 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.59 % Total time : 0.006000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.009000 s
%------------------------------------------------------------------------------