TSTP Solution File: MGT010-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT010-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%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 : 600s
% DateTime : Sun Jul 17 22:10:22 EDT 2022
% Result : Unsatisfiable 0.21s 0.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : MGT010-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n018.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.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 9 10:12:23 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 19 Number of unprocessed: 19
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 19 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 14 conjectures.
% 0.14/0.39 # There are 14 start rule candidates:
% 0.14/0.39 # Found 13 unit axioms.
% 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.39 # 14 start rule tableaux created.
% 0.14/0.39 # 6 extension rule candidate clauses
% 0.14/0.39 # 13 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.21/0.41 # There were 4 total branch saturation attempts.
% 0.21/0.41 # There were 0 of these attempts blocked.
% 0.21/0.41 # There were 0 deferred branch saturation attempts.
% 0.21/0.41 # There were 0 free duplicated saturations.
% 0.21/0.41 # There were 4 total successful branch saturations.
% 0.21/0.41 # There were 0 successful branch saturations in interreduction.
% 0.21/0.41 # There were 0 successful branch saturations on the branch.
% 0.21/0.41 # There were 4 successful branch saturations after the branch.
% 0.21/0.41 # There were 4 total branch saturation attempts.
% 0.21/0.41 # There were 0 of these attempts blocked.
% 0.21/0.41 # There were 0 deferred branch saturation attempts.
% 0.21/0.41 # There were 0 free duplicated saturations.
% 0.21/0.41 # There were 4 total successful branch saturations.
% 0.21/0.41 # There were 0 successful branch saturations in interreduction.
% 0.21/0.41 # There were 0 successful branch saturations on the branch.
% 0.21/0.41 # There were 4 successful branch saturations after the branch.
% 0.21/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # Begin clausification derivation
% 0.21/0.41
% 0.21/0.41 # End clausification derivation
% 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41 cnf(i_0_25, negated_conjecture, (organization(sk2,sk11))).
% 0.21/0.41 cnf(i_0_26, negated_conjecture, (organization(sk3,sk12))).
% 0.21/0.41 cnf(i_0_37, negated_conjecture, (greater(sk10,sk9))).
% 0.21/0.41 cnf(i_0_31, negated_conjecture, (reliability(sk2,sk5,sk11))).
% 0.21/0.41 cnf(i_0_32, negated_conjecture, (reliability(sk3,sk6,sk12))).
% 0.21/0.41 cnf(i_0_33, negated_conjecture, (accountability(sk2,sk7,sk11))).
% 0.21/0.41 cnf(i_0_34, negated_conjecture, (accountability(sk3,sk8,sk12))).
% 0.21/0.41 cnf(i_0_27, negated_conjecture, (reorganization_free(sk2,sk11,sk11))).
% 0.21/0.41 cnf(i_0_28, negated_conjecture, (reorganization_free(sk3,sk12,sk12))).
% 0.21/0.41 cnf(i_0_29, negated_conjecture, (class(sk2,sk4,sk11))).
% 0.21/0.41 cnf(i_0_30, negated_conjecture, (class(sk3,sk4,sk12))).
% 0.21/0.41 cnf(i_0_35, negated_conjecture, (size(sk2,sk9,sk11))).
% 0.21/0.41 cnf(i_0_36, negated_conjecture, (size(sk3,sk10,sk12))).
% 0.21/0.41 cnf(i_0_38, negated_conjecture, (~greater(sk6,sk5)|~greater(sk8,sk7))).
% 0.21/0.41 cnf(i_0_20, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))).
% 0.21/0.41 cnf(i_0_22, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X1,X6)|~accountability(X7,X2,X8)|~reliability(X5,X9,X6)|~reliability(X7,X10,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.21/0.41 cnf(i_0_21, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X6,X7)|~accountability(X8,X9,X10)|~reliability(X5,X1,X7)|~reliability(X8,X2,X10)|~reproducibility(X5,X3,X7)|~reproducibility(X8,X4,X10)|~organization(X5,X7)|~organization(X8,X10))).
% 0.21/0.41 cnf(i_0_23, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~reproducibility(X7,X1,X8)|~reproducibility(X9,X2,X10)|~organization(X7,X8)|~organization(X9,X10))).
% 0.21/0.41 cnf(i_0_24, hypothesis, (greater(X1,X2)|~size(X3,X4,X5)|~size(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X8)|~reorganization_free(X3,X5,X5)|~reorganization_free(X6,X8,X8)|~greater(X4,X7)|~reproducibility(X3,X1,X5)|~reproducibility(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.41 # Begin printing tableau
% 0.21/0.41 # Found 14 steps
% 0.21/0.41 cnf(i_0_30, negated_conjecture, (class(sk3,sk4,sk12)), inference(start_rule)).
% 0.21/0.41 cnf(i_0_43, plain, (class(sk3,sk4,sk12)), inference(extension_rule, [i_0_24])).
% 0.21/0.41 cnf(i_0_88, plain, (~size(sk3,sk10,sk12)), inference(closure_rule, [i_0_36])).
% 0.21/0.41 cnf(i_0_89, plain, (~size(sk3,sk10,sk12)), inference(closure_rule, [i_0_36])).
% 0.21/0.41 cnf(i_0_91, plain, (~class(sk3,sk4,sk12)), inference(closure_rule, [i_0_30])).
% 0.21/0.41 cnf(i_0_92, plain, (~reorganization_free(sk3,sk12,sk12)), inference(closure_rule, [i_0_28])).
% 0.21/0.41 cnf(i_0_93, plain, (~reorganization_free(sk3,sk12,sk12)), inference(closure_rule, [i_0_28])).
% 0.21/0.41 cnf(i_0_97, plain, (~organization(sk3,sk12)), inference(closure_rule, [i_0_26])).
% 0.21/0.41 cnf(i_0_98, plain, (~organization(sk3,sk12)), inference(closure_rule, [i_0_26])).
% 0.21/0.41 cnf(i_0_87, plain, (greater(sk6,sk5)), inference(extension_rule, [i_0_38])).
% 0.21/0.41 cnf(i_0_94, plain, (~greater(sk10,sk10)), inference(etableau_closure_rule, [i_0_94, ...])).
% 0.21/0.41 cnf(i_0_95, plain, (~reproducibility(sk3,sk6,sk12)), inference(etableau_closure_rule, [i_0_95, ...])).
% 0.21/0.41 cnf(i_0_96, plain, (~reproducibility(sk3,sk5,sk12)), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.21/0.41 cnf(i_0_133, plain, (~greater(sk8,sk7)), inference(etableau_closure_rule, [i_0_133, ...])).
% 0.21/0.41 # End printing tableau
% 0.21/0.41 # SZS output end
% 0.21/0.41 # Branches closed with saturation will be marked with an "s"
% 0.21/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # Begin clausification derivation
% 0.21/0.41
% 0.21/0.41 # End clausification derivation
% 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41 cnf(i_0_25, negated_conjecture, (organization(sk2,sk11))).
% 0.21/0.41 cnf(i_0_26, negated_conjecture, (organization(sk3,sk12))).
% 0.21/0.41 cnf(i_0_37, negated_conjecture, (greater(sk10,sk9))).
% 0.21/0.41 cnf(i_0_31, negated_conjecture, (reliability(sk2,sk5,sk11))).
% 0.21/0.41 cnf(i_0_32, negated_conjecture, (reliability(sk3,sk6,sk12))).
% 0.21/0.41 cnf(i_0_33, negated_conjecture, (accountability(sk2,sk7,sk11))).
% 0.21/0.41 cnf(i_0_34, negated_conjecture, (accountability(sk3,sk8,sk12))).
% 0.21/0.41 cnf(i_0_27, negated_conjecture, (reorganization_free(sk2,sk11,sk11))).
% 0.21/0.41 cnf(i_0_28, negated_conjecture, (reorganization_free(sk3,sk12,sk12))).
% 0.21/0.41 cnf(i_0_29, negated_conjecture, (class(sk2,sk4,sk11))).
% 0.21/0.41 cnf(i_0_30, negated_conjecture, (class(sk3,sk4,sk12))).
% 0.21/0.41 cnf(i_0_35, negated_conjecture, (size(sk2,sk9,sk11))).
% 0.21/0.41 cnf(i_0_36, negated_conjecture, (size(sk3,sk10,sk12))).
% 0.21/0.41 cnf(i_0_38, negated_conjecture, (~greater(sk6,sk5)|~greater(sk8,sk7))).
% 0.21/0.41 cnf(i_0_20, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))).
% 0.21/0.41 cnf(i_0_22, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X1,X6)|~accountability(X7,X2,X8)|~reliability(X5,X9,X6)|~reliability(X7,X10,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.21/0.41 cnf(i_0_21, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X6,X7)|~accountability(X8,X9,X10)|~reliability(X5,X1,X7)|~reliability(X8,X2,X10)|~reproducibility(X5,X3,X7)|~reproducibility(X8,X4,X10)|~organization(X5,X7)|~organization(X8,X10))).
% 0.21/0.41 cnf(i_0_23, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~reproducibility(X7,X1,X8)|~reproducibility(X9,X2,X10)|~organization(X7,X8)|~organization(X9,X10))).
% 0.21/0.41 cnf(i_0_24, hypothesis, (greater(X1,X2)|~size(X3,X4,X5)|~size(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X8)|~reorganization_free(X3,X5,X5)|~reorganization_free(X6,X8,X8)|~greater(X4,X7)|~reproducibility(X3,X1,X5)|~reproducibility(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.41 # Begin printing tableau
% 0.21/0.41 # Found 14 steps
% 0.21/0.41 cnf(i_0_35, negated_conjecture, (size(sk2,sk9,sk11)), inference(start_rule)).
% 0.21/0.41 cnf(i_0_42, plain, (size(sk2,sk9,sk11)), inference(extension_rule, [i_0_24])).
% 0.21/0.41 cnf(i_0_89, plain, (~size(sk3,sk10,sk12)), inference(closure_rule, [i_0_36])).
% 0.21/0.41 cnf(i_0_90, plain, (~class(sk2,sk4,sk11)), inference(closure_rule, [i_0_29])).
% 0.21/0.41 cnf(i_0_91, plain, (~class(sk3,sk4,sk12)), inference(closure_rule, [i_0_30])).
% 0.21/0.41 cnf(i_0_92, plain, (~reorganization_free(sk2,sk11,sk11)), inference(closure_rule, [i_0_27])).
% 0.21/0.41 cnf(i_0_93, plain, (~reorganization_free(sk3,sk12,sk12)), inference(closure_rule, [i_0_28])).
% 0.21/0.41 cnf(i_0_97, plain, (~organization(sk2,sk11)), inference(closure_rule, [i_0_25])).
% 0.21/0.41 cnf(i_0_98, plain, (~organization(sk3,sk12)), inference(closure_rule, [i_0_26])).
% 0.21/0.41 cnf(i_0_87, plain, (greater(sk6,sk5)), inference(extension_rule, [i_0_38])).
% 0.21/0.41 cnf(i_0_94, plain, (~greater(sk9,sk10)), inference(etableau_closure_rule, [i_0_94, ...])).
% 0.21/0.41 cnf(i_0_95, plain, (~reproducibility(sk2,sk6,sk11)), inference(etableau_closure_rule, [i_0_95, ...])).
% 0.21/0.41 cnf(i_0_96, plain, (~reproducibility(sk3,sk5,sk12)), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.21/0.41 cnf(i_0_133, plain, (~greater(sk8,sk7)), inference(etableau_closure_rule, [i_0_133, ...])).
% 0.21/0.41 # End printing tableau
% 0.21/0.41 # SZS output end
% 0.21/0.41 # Branches closed with saturation will be marked with an "s"
% 0.21/0.41 # There were 4 total branch saturation attempts.
% 0.21/0.41 # There were 0 of these attempts blocked.
% 0.21/0.41 # There were 0 deferred branch saturation attempts.
% 0.21/0.41 # There were 0 free duplicated saturations.
% 0.21/0.41 # There were 4 total successful branch saturations.
% 0.21/0.41 # There were 0 successful branch saturations in interreduction.
% 0.21/0.41 # There were 0 successful branch saturations on the branch.
% 0.21/0.41 # There were 4 successful branch saturations after the branch.
% 0.21/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # Begin clausification derivation
% 0.21/0.41
% 0.21/0.41 # End clausification derivation
% 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41 cnf(i_0_25, negated_conjecture, (organization(sk2,sk11))).
% 0.21/0.41 cnf(i_0_26, negated_conjecture, (organization(sk3,sk12))).
% 0.21/0.41 cnf(i_0_37, negated_conjecture, (greater(sk10,sk9))).
% 0.21/0.41 cnf(i_0_31, negated_conjecture, (reliability(sk2,sk5,sk11))).
% 0.21/0.41 cnf(i_0_32, negated_conjecture, (reliability(sk3,sk6,sk12))).
% 0.21/0.41 cnf(i_0_33, negated_conjecture, (accountability(sk2,sk7,sk11))).
% 0.21/0.41 cnf(i_0_34, negated_conjecture, (accountability(sk3,sk8,sk12))).
% 0.21/0.41 cnf(i_0_27, negated_conjecture, (reorganization_free(sk2,sk11,sk11))).
% 0.21/0.41 cnf(i_0_28, negated_conjecture, (reorganization_free(sk3,sk12,sk12))).
% 0.21/0.41 cnf(i_0_29, negated_conjecture, (class(sk2,sk4,sk11))).
% 0.21/0.41 cnf(i_0_30, negated_conjecture, (class(sk3,sk4,sk12))).
% 0.21/0.41 cnf(i_0_35, negated_conjecture, (size(sk2,sk9,sk11))).
% 0.21/0.41 cnf(i_0_36, negated_conjecture, (size(sk3,sk10,sk12))).
% 0.21/0.41 cnf(i_0_38, negated_conjecture, (~greater(sk6,sk5)|~greater(sk8,sk7))).
% 0.21/0.41 cnf(i_0_20, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))).
% 0.21/0.41 cnf(i_0_22, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X1,X6)|~accountability(X7,X2,X8)|~reliability(X5,X9,X6)|~reliability(X7,X10,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.21/0.41 cnf(i_0_21, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X6,X7)|~accountability(X8,X9,X10)|~reliability(X5,X1,X7)|~reliability(X8,X2,X10)|~reproducibility(X5,X3,X7)|~reproducibility(X8,X4,X10)|~organization(X5,X7)|~organization(X8,X10))).
% 0.21/0.41 cnf(i_0_23, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~reproducibility(X7,X1,X8)|~reproducibility(X9,X2,X10)|~organization(X7,X8)|~organization(X9,X10))).
% 0.21/0.41 cnf(i_0_24, hypothesis, (greater(X1,X2)|~size(X3,X4,X5)|~size(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X8)|~reorganization_free(X3,X5,X5)|~reorganization_free(X6,X8,X8)|~greater(X4,X7)|~reproducibility(X3,X1,X5)|~reproducibility(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.41 # Begin printing tableau
% 0.21/0.41 # Found 14 steps
% 0.21/0.41 cnf(i_0_29, negated_conjecture, (class(sk2,sk4,sk11)), inference(start_rule)).
% 0.21/0.41 cnf(i_0_44, plain, (class(sk2,sk4,sk11)), inference(extension_rule, [i_0_24])).
% 0.21/0.41 cnf(i_0_88, plain, (~size(sk2,sk9,sk11)), inference(closure_rule, [i_0_35])).
% 0.21/0.41 cnf(i_0_89, plain, (~size(sk3,sk10,sk12)), inference(closure_rule, [i_0_36])).
% 0.21/0.41 cnf(i_0_91, plain, (~class(sk3,sk4,sk12)), inference(closure_rule, [i_0_30])).
% 0.21/0.41 cnf(i_0_92, plain, (~reorganization_free(sk2,sk11,sk11)), inference(closure_rule, [i_0_27])).
% 0.21/0.41 cnf(i_0_93, plain, (~reorganization_free(sk3,sk12,sk12)), inference(closure_rule, [i_0_28])).
% 0.21/0.41 cnf(i_0_97, plain, (~organization(sk2,sk11)), inference(closure_rule, [i_0_25])).
% 0.21/0.41 cnf(i_0_98, plain, (~organization(sk3,sk12)), inference(closure_rule, [i_0_26])).
% 0.21/0.41 cnf(i_0_87, plain, (greater(sk6,sk5)), inference(extension_rule, [i_0_38])).
% 0.21/0.41 cnf(i_0_94, plain, (~greater(sk9,sk10)), inference(etableau_closure_rule, [i_0_94, ...])).
% 0.21/0.41 cnf(i_0_95, plain, (~reproducibility(sk2,sk6,sk11)), inference(etableau_closure_rule, [i_0_95, ...])).
% 0.21/0.41 cnf(i_0_96, plain, (~reproducibility(sk3,sk5,sk12)), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.21/0.41 cnf(i_0_133, plain, (~greater(sk8,sk7)), inference(etableau_closure_rule, [i_0_133, ...])).
% 0.21/0.41 # End printing tableau
% 0.21/0.41 # SZS output end
% 0.21/0.41 # Branches closed with saturation will be marked with an "s"
% 0.21/0.41 # There were 4 total branch saturation attempts.
% 0.21/0.41 # There were 0 of these attempts blocked.
% 0.21/0.41 # There were 0 deferred branch saturation attempts.
% 0.21/0.41 # There were 0 free duplicated saturations.
% 0.21/0.41 # There were 4 total successful branch saturations.
% 0.21/0.41 # There were 0 successful branch saturations in interreduction.
% 0.21/0.41 # There were 0 successful branch saturations on the branch.
% 0.21/0.41 # There were 4 successful branch saturations after the branch.
% 0.21/0.41 # There were 4 total branch saturation attempts.
% 0.21/0.41 # There were 0 of these attempts blocked.
% 0.21/0.41 # There were 0 deferred branch saturation attempts.
% 0.21/0.41 # There were 0 free duplicated saturations.
% 0.21/0.41 # There were 4 total successful branch saturations.
% 0.21/0.41 # There were 0 successful branch saturations in interreduction.
% 0.21/0.41 # There were 0 successful branch saturations on the branch.
% 0.21/0.41 # There were 4 successful branch saturations after the branch.
% 0.21/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.41 # Begin clausification derivation
% 0.21/0.41
% 0.21/0.41 # End clausification derivation
% 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41 cnf(i_0_25, negated_conjecture, (organization(sk2,sk11))).
% 0.21/0.41 cnf(i_0_26, negated_conjecture, (organization(sk3,sk12))).
% 0.21/0.41 cnf(i_0_37, negated_conjecture, (greater(sk10,sk9))).
% 0.21/0.41 cnf(i_0_31, negated_conjecture, (reliability(sk2,sk5,sk11))).
% 0.21/0.41 cnf(i_0_32, negated_conjecture, (reliability(sk3,sk6,sk12))).
% 0.21/0.41 cnf(i_0_33, negated_conjecture, (accountability(sk2,sk7,sk11))).
% 0.21/0.41 cnf(i_0_34, negated_conjecture, (accountability(sk3,sk8,sk12))).
% 0.21/0.41 cnf(i_0_27, negated_conjecture, (reorganization_free(sk2,sk11,sk11))).
% 0.21/0.41 cnf(i_0_28, negated_conjecture, (reorganization_free(sk3,sk12,sk12))).
% 0.21/0.41 cnf(i_0_29, negated_conjecture, (class(sk2,sk4,sk11))).
% 0.21/0.41 cnf(i_0_30, negated_conjecture, (class(sk3,sk4,sk12))).
% 0.21/0.41 cnf(i_0_35, negated_conjecture, (size(sk2,sk9,sk11))).
% 0.21/0.41 cnf(i_0_36, negated_conjecture, (size(sk3,sk10,sk12))).
% 0.21/0.41 cnf(i_0_38, negated_conjecture, (~greater(sk6,sk5)|~greater(sk8,sk7))).
% 0.21/0.41 cnf(i_0_20, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))).
% 0.21/0.41 cnf(i_0_22, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X1,X6)|~accountability(X7,X2,X8)|~reliability(X5,X9,X6)|~reliability(X7,X10,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))).
% 0.21/0.41 cnf(i_0_21, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~accountability(X5,X6,X7)|~accountability(X8,X9,X10)|~reliability(X5,X1,X7)|~reliability(X8,X2,X10)|~reproducibility(X5,X3,X7)|~reproducibility(X8,X4,X10)|~organization(X5,X7)|~organization(X8,X10))).
% 0.21/0.41 cnf(i_0_23, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~greater(X5,X6)|~accountability(X7,X3,X8)|~accountability(X9,X4,X10)|~reliability(X7,X5,X8)|~reliability(X9,X6,X10)|~reproducibility(X7,X1,X8)|~reproducibility(X9,X2,X10)|~organization(X7,X8)|~organization(X9,X10))).
% 0.21/0.41 cnf(i_0_24, hypothesis, (greater(X1,X2)|~size(X3,X4,X5)|~size(X6,X7,X8)|~class(X3,X9,X5)|~class(X6,X9,X8)|~reorganization_free(X3,X5,X5)|~reorganization_free(X6,X8,X8)|~greater(X4,X7)|~reproducibility(X3,X1,X5)|~reproducibility(X6,X2,X8)|~organization(X3,X5)|~organization(X6,X8))).
% 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.41 # Begin printing tableau
% 0.21/0.41 # Found 14 steps
% 0.21/0.41 cnf(i_0_27, negated_conjecture, (reorganization_free(sk2,sk11,sk11)), inference(start_rule)).
% 0.21/0.41 cnf(i_0_46, plain, (reorganization_free(sk2,sk11,sk11)), inference(extension_rule, [i_0_24])).
% 0.21/0.41 cnf(i_0_88, plain, (~size(sk2,sk9,sk11)), inference(closure_rule, [i_0_35])).
% 0.21/0.41 cnf(i_0_89, plain, (~size(sk3,sk10,sk12)), inference(closure_rule, [i_0_36])).
% 0.21/0.41 cnf(i_0_90, plain, (~class(sk2,sk4,sk11)), inference(closure_rule, [i_0_29])).
% 0.21/0.41 cnf(i_0_91, plain, (~class(sk3,sk4,sk12)), inference(closure_rule, [i_0_30])).
% 0.21/0.41 cnf(i_0_93, plain, (~reorganization_free(sk3,sk12,sk12)), inference(closure_rule, [i_0_28])).
% 0.21/0.41 cnf(i_0_97, plain, (~organization(sk2,sk11)), inference(closure_rule, [i_0_25])).
% 0.21/0.41 cnf(i_0_98, plain, (~organization(sk3,sk12)), inference(closure_rule, [i_0_26])).
% 0.21/0.41 cnf(i_0_87, plain, (greater(sk6,sk5)), inference(extension_rule, [i_0_38])).
% 0.21/0.41 cnf(i_0_94, plain, (~greater(sk9,sk10)), inference(etableau_closure_rule, [i_0_94, ...])).
% 0.21/0.41 cnf(i_0_95, plain, (~reproducibility(sk2,sk6,sk11)), inference(etableau_closure_rule, [i_0_95, ...])).
% 0.21/0.41 cnf(i_0_96, plain, (~reproducibility(sk3,sk5,sk12)), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.21/0.41 cnf(i_0_133, plain, (~greater(sk8,sk7)), inference(etableau_closure_rule, [i_0_133, ...])).
% 0.21/0.41 # End printing tableau
% 0.21/0.42 # SZS output end
% 0.21/0.42 # Branches closed with saturation will be marked with an "s"
% 0.21/0.42 # Child (6318) has found a proof.
% 0.21/0.42
% 0.21/0.42 # Proof search is over...
% 0.21/0.42 # Freeing feature tree
%------------------------------------------------------------------------------