TSTP Solution File: NUM285-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM285-1 : TPTP v8.1.0. Released v1.1.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 : n008.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 : Mon Jul 18 09:39:56 EDT 2022
% Result : Satisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM285-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/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 : n008.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 : Tue Jul 5 16:44:08 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: 54 Number of unprocessed: 42
% 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 # 42 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 42 conjectures.
% 0.12/0.36 # There are 42 start rule candidates:
% 0.12/0.36 # Found 4 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 42 start rule tableaux created.
% 0.12/0.36 # 38 extension rule candidate clauses
% 0.12/0.36 # 4 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # 21148 Satisfiable branch
% 0.12/0.37 # 21149 Satisfiable branch
% 0.12/0.37 # 21152 Satisfiable branch
% 0.12/0.37 # 21153 Satisfiable branch
% 0.12/0.37 # 21150 Satisfiable branch
% 0.12/0.37 # 21151 Satisfiable branch
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.12/0.37 # 21154 Satisfiable branch
% 0.12/0.37 # SZS status Satisfiable 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_108, negated_conjecture, (p5)).
% 0.12/0.37 cnf(i_0_107, negated_conjecture, (q5)).
% 0.12/0.37 cnf(i_0_71, negated_conjecture, (a5)).
% 0.12/0.37 cnf(i_0_106, negated_conjecture, (b5)).
% 0.12/0.37 cnf(i_0_96, negated_conjecture, (~b0|~a0)).
% 0.12/0.37 cnf(i_0_97, negated_conjecture, (a1|~b1)).
% 0.12/0.37 cnf(i_0_99, negated_conjecture, (a2|~b2)).
% 0.12/0.37 cnf(i_0_95, negated_conjecture, (b0|a0)).
% 0.12/0.37 cnf(i_0_101, negated_conjecture, (a3|~b3)).
% 0.12/0.37 cnf(i_0_103, negated_conjecture, (a4|~b4)).
% 0.12/0.37 cnf(i_0_56, negated_conjecture, (~a1|~a0|~p1)).
% 0.12/0.37 cnf(i_0_60, negated_conjecture, (~a2|~p2|~p1)).
% 0.12/0.37 cnf(i_0_98, negated_conjecture, (b1|~a1)).
% 0.12/0.37 cnf(i_0_100, negated_conjecture, (b2|~a2)).
% 0.12/0.37 cnf(i_0_102, negated_conjecture, (b3|~a3)).
% 0.12/0.37 cnf(i_0_104, negated_conjecture, (b4|~a4)).
% 0.12/0.37 cnf(i_0_57, negated_conjecture, (a0|p1|~a1)).
% 0.12/0.37 cnf(i_0_58, negated_conjecture, (a1|p1|~a0)).
% 0.12/0.37 cnf(i_0_76, negated_conjecture, (~b1|~b0|~q1)).
% 0.12/0.37 cnf(i_0_80, negated_conjecture, (~b2|~q2|~q1)).
% 0.12/0.37 cnf(i_0_61, negated_conjecture, (p2|p1|~a2)).
% 0.12/0.37 cnf(i_0_59, negated_conjecture, (a2|p1|~p2)).
% 0.12/0.37 cnf(i_0_55, negated_conjecture, (a1|a0|~p1)).
% 0.12/0.37 cnf(i_0_65, negated_conjecture, (p3|p2|~a3)).
% 0.12/0.37 cnf(i_0_69, negated_conjecture, (p4|p3|~a4)).
% 0.12/0.37 cnf(i_0_77, negated_conjecture, (b0|q1|~b1)).
% 0.12/0.37 cnf(i_0_62, negated_conjecture, (a2|p2|~p1)).
% 0.12/0.37 cnf(i_0_81, negated_conjecture, (q2|q1|~b2)).
% 0.12/0.37 cnf(i_0_85, negated_conjecture, (q3|q2|~b3)).
% 0.12/0.37 cnf(i_0_89, negated_conjecture, (q4|q3|~b4)).
% 0.12/0.37 cnf(i_0_63, negated_conjecture, (a3|~p3)).
% 0.12/0.37 cnf(i_0_66, negated_conjecture, (a3|~p2)).
% 0.12/0.37 cnf(i_0_67, negated_conjecture, (a4|~p4)).
% 0.12/0.37 cnf(i_0_70, negated_conjecture, (a4|~p3)).
% 0.12/0.37 cnf(i_0_78, negated_conjecture, (b1|q1|~b0)).
% 0.12/0.37 cnf(i_0_79, negated_conjecture, (b2|q1|~q2)).
% 0.12/0.37 cnf(i_0_75, negated_conjecture, (b1|b0|~q1)).
% 0.12/0.37 cnf(i_0_82, negated_conjecture, (b2|q2|~q1)).
% 0.12/0.37 cnf(i_0_83, negated_conjecture, (b3|~q3)).
% 0.12/0.37 cnf(i_0_86, negated_conjecture, (b3|~q2)).
% 0.12/0.37 cnf(i_0_87, negated_conjecture, (b4|~q4)).
% 0.12/0.37 cnf(i_0_90, negated_conjecture, (b4|~q3)).
% 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 3 steps
% 0.12/0.37 cnf(i_0_90, negated_conjecture, (b4|~q3), inference(start_rule)).
% 0.12/0.37 cnf(i_0_109, plain, (b4), inference(extension_rule, [i_0_103])).
% 0.12/0.37 cnf(i_0_293, plain, (a4), inference(extension_rule, [i_0_69])).
% 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 # Satisfiable branch found.
% 0.12/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable 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_108, negated_conjecture, (p5)).
% 0.12/0.37 cnf(i_0_107, negated_conjecture, (q5)).
% 0.12/0.37 cnf(i_0_71, negated_conjecture, (a5)).
% 0.12/0.37 cnf(i_0_106, negated_conjecture, (b5)).
% 0.12/0.37 cnf(i_0_96, negated_conjecture, (~b0|~a0)).
% 0.12/0.37 cnf(i_0_97, negated_conjecture, (a1|~b1)).
% 0.12/0.37 cnf(i_0_99, negated_conjecture, (a2|~b2)).
% 0.12/0.37 cnf(i_0_95, negated_conjecture, (b0|a0)).
% 0.12/0.37 cnf(i_0_101, negated_conjecture, (a3|~b3)).
% 0.12/0.37 cnf(i_0_103, negated_conjecture, (a4|~b4)).
% 0.12/0.37 cnf(i_0_56, negated_conjecture, (~a1|~a0|~p1)).
% 0.12/0.37 cnf(i_0_60, negated_conjecture, (~a2|~p2|~p1)).
% 0.12/0.37 cnf(i_0_98, negated_conjecture, (b1|~a1)).
% 0.12/0.37 cnf(i_0_100, negated_conjecture, (b2|~a2)).
% 0.12/0.37 cnf(i_0_102, negated_conjecture, (b3|~a3)).
% 0.12/0.37 cnf(i_0_104, negated_conjecture, (b4|~a4)).
% 0.12/0.37 cnf(i_0_57, negated_conjecture, (a0|p1|~a1)).
% 0.12/0.37 cnf(i_0_58, negated_conjecture, (a1|p1|~a0)).
% 0.12/0.37 cnf(i_0_76, negated_conjecture, (~b1|~b0|~q1)).
% 0.12/0.37 cnf(i_0_80, negated_conjecture, (~b2|~q2|~q1)).
% 0.12/0.37 cnf(i_0_61, negated_conjecture, (p2|p1|~a2)).
% 0.12/0.37 cnf(i_0_59, negated_conjecture, (a2|p1|~p2)).
% 0.12/0.37 cnf(i_0_55, negated_conjecture, (a1|a0|~p1)).
% 0.12/0.37 cnf(i_0_65, negated_conjecture, (p3|p2|~a3)).
% 0.12/0.37 cnf(i_0_69, negated_conjecture, (p4|p3|~a4)).
% 0.12/0.37 cnf(i_0_77, negated_conjecture, (b0|q1|~b1)).
% 0.12/0.37 cnf(i_0_62, negated_conjecture, (a2|p2|~p1)).
% 0.12/0.37 cnf(i_0_81, negated_conjecture, (q2|q1|~b2)).
% 0.12/0.37 cnf(i_0_85, negated_conjecture, (q3|q2|~b3)).
% 0.12/0.37 cnf(i_0_89, negated_conjecture, (q4|q3|~b4)).
% 0.12/0.37 cnf(i_0_63, negated_conjecture, (a3|~p3)).
% 0.12/0.37 cnf(i_0_66, negated_conjecture, (a3|~p2)).
% 0.12/0.37 cnf(i_0_67, negated_conjecture, (a4|~p4)).
% 0.12/0.37 cnf(i_0_70, negated_conjecture, (a4|~p3)).
% 0.12/0.37 cnf(i_0_78, negated_conjecture, (b1|q1|~b0)).
% 0.12/0.37 cnf(i_0_79, negated_conjecture, (b2|q1|~q2)).
% 0.12/0.37 cnf(i_0_75, negated_conjecture, (b1|b0|~q1)).
% 0.12/0.37 cnf(i_0_82, negated_conjecture, (b2|q2|~q1)).
% 0.12/0.37 cnf(i_0_83, negated_conjecture, (b3|~q3)).
% 0.12/0.37 cnf(i_0_86, negated_conjecture, (b3|~q2)).
% 0.12/0.37 cnf(i_0_87, negated_conjecture, (b4|~q4)).
% 0.12/0.37 cnf(i_0_90, negated_conjecture, (b4|~q3)).
% 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 3 steps
% 0.12/0.37 cnf(i_0_87, negated_conjecture, (b4|~q4), inference(start_rule)).
% 0.12/0.37 cnf(i_0_111, plain, (b4), inference(extension_rule, [i_0_103])).
% 0.12/0.37 cnf(i_0_293, plain, (a4), inference(extension_rule, [i_0_69])).
% 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 # Satisfiable branch found.
% 0.12/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable 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_108, negated_conjecture, (p5)).
% 0.12/0.37 cnf(i_0_107, negated_conjecture, (q5)).
% 0.12/0.37 cnf(i_0_71, negated_conjecture, (a5)).
% 0.12/0.37 cnf(i_0_106, negated_conjecture, (b5)).
% 0.12/0.37 cnf(i_0_96, negated_conjecture, (~b0|~a0)).
% 0.12/0.37 cnf(i_0_97, negated_conjecture, (a1|~b1)).
% 0.12/0.37 cnf(i_0_99, negated_conjecture, (a2|~b2)).
% 0.12/0.37 cnf(i_0_95, negated_conjecture, (b0|a0)).
% 0.12/0.37 cnf(i_0_101, negated_conjecture, (a3|~b3)).
% 0.12/0.37 cnf(i_0_103, negated_conjecture, (a4|~b4)).
% 0.12/0.37 cnf(i_0_56, negated_conjecture, (~a1|~a0|~p1)).
% 0.12/0.37 cnf(i_0_60, negated_conjecture, (~a2|~p2|~p1)).
% 0.12/0.37 cnf(i_0_98, negated_conjecture, (b1|~a1)).
% 0.12/0.37 cnf(i_0_100, negated_conjecture, (b2|~a2)).
% 0.12/0.37 cnf(i_0_102, negated_conjecture, (b3|~a3)).
% 0.12/0.37 cnf(i_0_104, negated_conjecture, (b4|~a4)).
% 0.12/0.37 cnf(i_0_57, negated_conjecture, (a0|p1|~a1)).
% 0.12/0.37 cnf(i_0_58, negated_conjecture, (a1|p1|~a0)).
% 0.12/0.37 cnf(i_0_76, negated_conjecture, (~b1|~b0|~q1)).
% 0.12/0.37 cnf(i_0_80, negated_conjecture, (~b2|~q2|~q1)).
% 0.12/0.37 cnf(i_0_61, negated_conjecture, (p2|p1|~a2)).
% 0.12/0.37 cnf(i_0_59, negated_conjecture, (a2|p1|~p2)).
% 0.12/0.37 cnf(i_0_55, negated_conjecture, (a1|a0|~p1)).
% 0.12/0.37 cnf(i_0_65, negated_conjecture, (p3|p2|~a3)).
% 0.12/0.37 cnf(i_0_69, negated_conjecture, (p4|p3|~a4)).
% 0.12/0.37 cnf(i_0_77, negated_conjecture, (b0|q1|~b1)).
% 0.12/0.37 cnf(i_0_62, negated_conjecture, (a2|p2|~p1)).
% 0.12/0.37 cnf(i_0_81, negated_conjecture, (q2|q1|~b2)).
% 0.12/0.37 cnf(i_0_85, negated_conjecture, (q3|q2|~b3)).
% 0.12/0.37 cnf(i_0_89, negated_conjecture, (q4|q3|~b4)).
% 0.12/0.37 cnf(i_0_63, negated_conjecture, (a3|~p3)).
% 0.12/0.37 cnf(i_0_66, negated_conjecture, (a3|~p2)).
% 0.12/0.37 cnf(i_0_67, negated_conjecture, (a4|~p4)).
% 0.12/0.37 cnf(i_0_70, negated_conjecture, (a4|~p3)).
% 0.12/0.37 cnf(i_0_78, negated_conjecture, (b1|q1|~b0)).
% 0.12/0.37 cnf(i_0_79, negated_conjecture, (b2|q1|~q2)).
% 0.12/0.37 cnf(i_0_75, negated_conjecture, (b1|b0|~q1)).
% 0.12/0.37 cnf(i_0_82, negated_conjecture, (b2|q2|~q1)).
% 0.12/0.37 cnf(i_0_83, negated_conjecture, (b3|~q3)).
% 0.12/0.37 cnf(i_0_86, negated_conjecture, (b3|~q2)).
% 0.12/0.37 cnf(i_0_87, negated_conjecture, (b4|~q4)).
% 0.12/0.37 cnf(i_0_90, negated_conjecture, (b4|~q3)).
% 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 3 steps
% 0.12/0.37 cnf(i_0_82, negated_conjecture, (b2|q2|~q1), inference(start_rule)).
% 0.12/0.37 cnf(i_0_117, plain, (b2), inference(extension_rule, [i_0_99])).
% 0.12/0.37 cnf(i_0_299, plain, (a2), inference(extension_rule, [i_0_61])).
% 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 # Satisfiable branch found.
% 0.12/0.37 # SZS status Satisfiable 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_108, negated_conjecture, (p5)).
% 0.12/0.37 cnf(i_0_107, negated_conjecture, (q5)).
% 0.12/0.37 cnf(i_0_71, negated_conjecture, (a5)).
% 0.12/0.37 cnf(i_0_106, negated_conjecture, (b5)).
% 0.12/0.37 cnf(i_0_96, negated_conjecture, (~b0|~a0)).
% 0.12/0.37 cnf(i_0_97, negated_conjecture, (a1|~b1)).
% 0.12/0.37 cnf(i_0_99, negated_conjecture, (a2|~b2)).
% 0.12/0.37 cnf(i_0_95, negated_conjecture, (b0|a0)).
% 0.12/0.37 cnf(i_0_101, negated_conjecture, (a3|~b3)).
% 0.12/0.37 cnf(i_0_103, negated_conjecture, (a4|~b4)).
% 0.12/0.37 cnf(i_0_56, negated_conjecture, (~a1|~a0|~p1)).
% 0.12/0.37 cnf(i_0_60, negated_conjecture, (~a2|~p2|~p1)).
% 0.12/0.37 cnf(i_0_98, negated_conjecture, (b1|~a1)).
% 0.12/0.37 cnf(i_0_100, negated_conjecture, (b2|~a2)).
% 0.12/0.37 cnf(i_0_102, negated_conjecture, (b3|~a3)).
% 0.12/0.37 cnf(i_0_104, negated_conjecture, (b4|~a4)).
% 0.12/0.37 cnf(i_0_57, negated_conjecture, (a0|p1|~a1)).
% 0.12/0.37 cnf(i_0_58, negated_conjecture, (a1|p1|~a0)).
% 0.12/0.37 cnf(i_0_76, negated_conjecture, (~b1|~b0|~q1)).
% 0.12/0.37 cnf(i_0_80, negated_conjecture, (~b2|~q2|~q1)).
% 0.12/0.37 cnf(i_0_61, negated_conjecture, (p2|p1|~a2)).
% 0.12/0.37 cnf(i_0_59, negated_conjecture, (a2|p1|~p2)).
% 0.12/0.37 cnf(i_0_55, negated_conjecture, (a1|a0|~p1)).
% 0.12/0.37 cnf(i_0_65, negated_conjecture, (p3|p2|~a3)).
% 0.12/0.37 cnf(i_0_69, negated_conjecture, (p4|p3|~a4)).
% 0.12/0.37 cnf(i_0_77, negated_conjecture, (b0|q1|~b1)).
% 0.12/0.37 cnf(i_0_62, negated_conjecture, (a2|p2|~p1)).
% 0.12/0.37 cnf(i_0_81, negated_conjecture, (q2|q1|~b2)).
% 0.12/0.37 cnf(i_0_85, negated_conjecture, (q3|q2|~b3)).
% 0.12/0.37 cnf(i_0_89, negated_conjecture, (q4|q3|~b4)).
% 0.12/0.37 cnf(i_0_63, negated_conjecture, (a3|~p3)).
% 0.12/0.37 cnf(i_0_66, negated_conjecture, (a3|~p2)).
% 0.12/0.37 cnf(i_0_67, negated_conjecture, (a4|~p4)).
% 0.12/0.37 cnf(i_0_70, negated_conjecture, (a4|~p3)).
% 0.12/0.37 cnf(i_0_78, negated_conjecture, (b1|q1|~b0)).
% 0.12/0.37 cnf(i_0_79, negated_conjecture, (b2|q1|~q2)).
% 0.12/0.37 cnf(i_0_75, negated_conjecture, (b1|b0|~q1)).
% 0.12/0.37 cnf(i_0_82, negated_conjecture, (b2|q2|~q1)).
% 0.12/0.37 cnf(i_0_83, negated_conjecture, (b3|~q3)).
% 0.12/0.37 cnf(i_0_86, negated_conjecture, (b3|~q2)).
% 0.12/0.37 cnf(i_0_87, negated_conjecture, (b4|~q4)).
% 0.12/0.37 cnf(i_0_90, negated_conjecture, (b4|~q3)).
% 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 3 steps
% 0.12/0.37 cnf(i_0_75, negated_conjecture, (b1|b0|~q1), inference(start_rule)).
% 0.12/0.37 cnf(i_0_120, plain, (b1), inference(extension_rule, [i_0_97])).
% 0.12/0.37 cnf(i_0_301, plain, (a1), inference(extension_rule, [i_0_57])).
% 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 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable 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_108, negated_conjecture, (p5)).
% 0.12/0.37 cnf(i_0_107, negated_conjecture, (q5)).
% 0.12/0.37 cnf(i_0_71, negated_conjecture, (a5)).
% 0.12/0.37 cnf(i_0_106, negated_conjecture, (b5)).
% 0.12/0.37 cnf(i_0_96, negated_conjecture, (~b0|~a0)).
% 0.12/0.37 cnf(i_0_97, negated_conjecture, (a1|~b1)).
% 0.12/0.37 cnf(i_0_99, negated_conjecture, (a2|~b2)).
% 0.12/0.37 cnf(i_0_95, negated_conjecture, (b0|a0)).
% 0.12/0.37 cnf(i_0_101, negated_conjecture, (a3|~b3)).
% 0.12/0.37 cnf(i_0_103, negated_conjecture, (a4|~b4)).
% 0.12/0.37 cnf(i_0_56, negated_conjecture, (~a1|~a0|~p1)).
% 0.12/0.37 cnf(i_0_60, negated_conjecture, (~a2|~p2|~p1)).
% 0.12/0.37 cnf(i_0_98, negated_conjecture, (b1|~a1)).
% 0.12/0.37 cnf(i_0_100, negated_conjecture, (b2|~a2)).
% 0.12/0.37 cnf(i_0_102, negated_conjecture, (b3|~a3)).
% 0.12/0.37 cnf(i_0_104, negated_conjecture, (b4|~a4)).
% 0.12/0.37 cnf(i_0_57, negated_conjecture, (a0|p1|~a1)).
% 0.12/0.37 cnf(i_0_58, negated_conjecture, (a1|p1|~a0)).
% 0.12/0.37 cnf(i_0_76, negated_conjecture, (~b1|~b0|~q1)).
% 0.12/0.37 cnf(i_0_80, negated_conjecture, (~b2|~q2|~q1)).
% 0.12/0.37 cnf(i_0_61, negated_conjecture, (p2|p1|~a2)).
% 0.12/0.37 cnf(i_0_59, negated_conjecture, (a2|p1|~p2)).
% 0.12/0.37 cnf(i_0_55, negated_conjecture, (a1|a0|~p1)).
% 0.12/0.37 cnf(i_0_65, negated_conjecture, (p3|p2|~a3)).
% 0.12/0.37 cnf(i_0_69, negated_conjecture, (p4|p3|~a4)).
% 0.12/0.37 cnf(i_0_77, negated_conjecture, (b0|q1|~b1)).
% 0.12/0.37 cnf(i_0_62, negated_conjecture, (a2|p2|~p1)).
% 0.12/0.37 cnf(i_0_81, negated_conjecture, (q2|q1|~b2)).
% 0.12/0.37 cnf(i_0_85, negated_conjecture, (q3|q2|~b3)).
% 0.12/0.37 cnf(i_0_89, negated_conjecture, (q4|q3|~b4)).
% 0.12/0.37 cnf(i_0_63, negated_conjecture, (a3|~p3)).
% 0.12/0.37 cnf(i_0_66, negated_conjecture, (a3|~p2)).
% 0.12/0.37 cnf(i_0_67, negated_conjecture, (a4|~p4)).
% 0.12/0.37 cnf(i_0_70, negated_conjecture, (a4|~p3)).
% 0.12/0.37 cnf(i_0_78, negated_conjecture, (b1|q1|~b0)).
% 0.12/0.37 cnf(i_0_79, negated_conjecture, (b2|q1|~q2)).
% 0.12/0.37 cnf(i_0_75, negated_conjecture, (b1|b0|~q1)).
% 0.12/0.37 cnf(i_0_82, negated_conjecture, (b2|q2|~q1)).
% 0.12/0.37 cnf(i_0_83, negated_conjecture, (b3|~q3)).
% 0.12/0.37 cnf(i_0_86, negated_conjecture, (b3|~q2)).
% 0.12/0.37 cnf(i_0_87, negated_conjecture, (b4|~q4)).
% 0.12/0.37 cnf(i_0_90, negated_conjecture, (b4|~q3)).
% 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 3 steps
% 0.12/0.37 cnf(i_0_86, negated_conjecture, (b3|~q2), inference(start_rule)).
% 0.12/0.37 cnf(i_0_113, plain, (b3), inference(extension_rule, [i_0_101])).
% 0.12/0.37 cnf(i_0_295, plain, (a3), inference(extension_rule, [i_0_65])).
% 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 # Satisfiable branch found.
% 0.12/0.37 # There were 1 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 0 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 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable 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_108, negated_conjecture, (p5)).
% 0.12/0.37 cnf(i_0_107, negated_conjecture, (q5)).
% 0.12/0.37 cnf(i_0_71, negated_conjecture, (a5)).
% 0.12/0.37 cnf(i_0_106, negated_conjecture, (b5)).
% 0.12/0.37 cnf(i_0_96, negated_conjecture, (~b0|~a0)).
% 0.12/0.37 cnf(i_0_97, negated_conjecture, (a1|~b1)).
% 0.12/0.37 cnf(i_0_99, negated_conjecture, (a2|~b2)).
% 0.12/0.37 cnf(i_0_95, negated_conjecture, (b0|a0)).
% 0.12/0.37 cnf(i_0_101, negated_conjecture, (a3|~b3)).
% 0.12/0.37 cnf(i_0_103, negated_conjecture, (a4|~b4)).
% 0.12/0.37 cnf(i_0_56, negated_conjecture, (~a1|~a0|~p1)).
% 0.12/0.37 cnf(i_0_60, negated_conjecture, (~a2|~p2|~p1)).
% 0.12/0.37 cnf(i_0_98, negated_conjecture, (b1|~a1)).
% 0.12/0.37 cnf(i_0_100, negated_conjecture, (b2|~a2)).
% 0.12/0.37 cnf(i_0_102, negated_conjecture, (b3|~a3)).
% 0.12/0.37 cnf(i_0_104, negated_conjecture, (b4|~a4)).
% 0.12/0.37 cnf(i_0_57, negated_conjecture, (a0|p1|~a1)).
% 0.12/0.37 cnf(i_0_58, negated_conjecture, (a1|p1|~a0)).
% 0.12/0.37 cnf(i_0_76, negated_conjecture, (~b1|~b0|~q1)).
% 0.12/0.37 cnf(i_0_80, negated_conjecture, (~b2|~q2|~q1)).
% 0.12/0.37 cnf(i_0_61, negated_conjecture, (p2|p1|~a2)).
% 0.12/0.37 cnf(i_0_59, negated_conjecture, (a2|p1|~p2)).
% 0.12/0.37 cnf(i_0_55, negated_conjecture, (a1|a0|~p1)).
% 0.12/0.37 cnf(i_0_65, negated_conjecture, (p3|p2|~a3)).
% 0.12/0.37 cnf(i_0_69, negated_conjecture, (p4|p3|~a4)).
% 0.12/0.37 cnf(i_0_77, negated_conjecture, (b0|q1|~b1)).
% 0.12/0.37 cnf(i_0_62, negated_conjecture, (a2|p2|~p1)).
% 0.12/0.37 cnf(i_0_81, negated_conjecture, (q2|q1|~b2)).
% 0.12/0.37 cnf(i_0_85, negated_conjecture, (q3|q2|~b3)).
% 0.12/0.37 cnf(i_0_89, negated_conjecture, (q4|q3|~b4)).
% 0.12/0.37 cnf(i_0_63, negated_conjecture, (a3|~p3)).
% 0.12/0.37 cnf(i_0_66, negated_conjecture, (a3|~p2)).
% 0.12/0.37 cnf(i_0_67, negated_conjecture, (a4|~p4)).
% 0.12/0.37 cnf(i_0_70, negated_conjecture, (a4|~p3)).
% 0.12/0.37 cnf(i_0_78, negated_conjecture, (b1|q1|~b0)).
% 0.12/0.37 cnf(i_0_79, negated_conjecture, (b2|q1|~q2)).
% 0.12/0.37 cnf(i_0_75, negated_conjecture, (b1|b0|~q1)).
% 0.12/0.37 cnf(i_0_82, negated_conjecture, (b2|q2|~q1)).
% 0.12/0.37 cnf(i_0_83, negated_conjecture, (b3|~q3)).
% 0.12/0.37 cnf(i_0_86, negated_conjecture, (b3|~q2)).
% 0.12/0.37 cnf(i_0_87, negated_conjecture, (b4|~q4)).
% 0.12/0.37 cnf(i_0_90, negated_conjecture, (b4|~q3)).
% 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 3 steps
% 0.12/0.37 cnf(i_0_83, negated_conjecture, (b3|~q3), inference(start_rule)).
% 0.12/0.37 cnf(i_0_115, plain, (b3), inference(extension_rule, [i_0_101])).
% 0.12/0.37 cnf(i_0_295, plain, (a3), inference(extension_rule, [i_0_65])).
% 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 (21148) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------