TSTP Solution File: MGT006-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT006-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 : n020.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:20 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT006-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n020.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 08:21:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 14 Number of unprocessed: 14
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 14 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 9 conjectures.
% 0.12/0.36 # There are 9 start rule candidates:
% 0.12/0.36 # Found 8 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 9 start rule tableaux created.
% 0.12/0.36 # 6 extension rule candidate clauses
% 0.12/0.36 # 8 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There were 3 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 3 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 3 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_20, negated_conjecture, (organization(sk2,sk7))).
% 0.12/0.37 cnf(i_0_21, negated_conjecture, (organization(sk2,sk8))).
% 0.12/0.37 cnf(i_0_27, negated_conjecture, (greater(sk8,sk7))).
% 0.12/0.37 cnf(i_0_23, negated_conjecture, (reliability(sk2,sk3,sk7))).
% 0.12/0.37 cnf(i_0_24, negated_conjecture, (reliability(sk2,sk4,sk8))).
% 0.12/0.37 cnf(i_0_25, negated_conjecture, (accountability(sk2,sk5,sk7))).
% 0.12/0.37 cnf(i_0_26, negated_conjecture, (accountability(sk2,sk6,sk8))).
% 0.12/0.37 cnf(i_0_22, negated_conjecture, (reorganization_free(sk2,sk7,sk8))).
% 0.12/0.37 cnf(i_0_28, negated_conjecture, (~greater(sk4,sk3)|~greater(sk6,sk5))).
% 0.12/0.37 cnf(i_0_15, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))).
% 0.12/0.37 cnf(i_0_19, hypothesis, (greater(X1,X2)|~reorganization_free(X3,X4,X5)|~greater(X5,X4)|~reproducibility(X3,X1,X5)|~reproducibility(X3,X2,X4)|~organization(X3,X5)|~organization(X3,X4))).
% 0.12/0.37 cnf(i_0_17, 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.12/0.37 cnf(i_0_16, 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.12/0.37 cnf(i_0_18, 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.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 9 steps
% 0.12/0.37 cnf(i_0_22, negated_conjecture, (reorganization_free(sk2,sk7,sk8)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_31, plain, (reorganization_free(sk2,sk7,sk8)), inference(extension_rule, [i_0_19])).
% 0.12/0.37 cnf(i_0_43, plain, (~greater(sk8,sk7)), inference(closure_rule, [i_0_27])).
% 0.12/0.37 cnf(i_0_46, plain, (~organization(sk2,sk8)), inference(closure_rule, [i_0_21])).
% 0.12/0.37 cnf(i_0_47, plain, (~organization(sk2,sk7)), inference(closure_rule, [i_0_20])).
% 0.12/0.37 cnf(i_0_41, plain, (greater(sk4,sk3)), inference(extension_rule, [i_0_28])).
% 0.12/0.37 cnf(i_0_44, plain, (~reproducibility(sk2,sk4,sk8)), inference(etableau_closure_rule, [i_0_44, ...])).
% 0.12/0.37 cnf(i_0_45, plain, (~reproducibility(sk2,sk3,sk7)), inference(etableau_closure_rule, [i_0_45, ...])).
% 0.12/0.37 cnf(i_0_82, plain, (~greater(sk6,sk5)), inference(etableau_closure_rule, [i_0_82, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (30199) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------