TSTP Solution File: SYN494-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN494-1 : TPTP v8.1.0. Released v2.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 : 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 : 600s
% DateTime : Thu Jul 21 06:11:43 EDT 2022
% Result : Satisfiable 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN494-1 : TPTP v8.1.0. Released v2.1.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 14:38:43 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 56 Number of unprocessed: 56
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 56 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 56 conjectures.
% 0.14/0.37 # There are 56 start rule candidates:
% 0.14/0.37 # Found 0 unit axioms.
% 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.37 # 56 start rule tableaux created.
% 0.14/0.37 # 56 extension rule candidate clauses
% 0.14/0.37 # 0 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # 18393 Satisfiable branch
% 0.14/0.38 # 18394 Satisfiable branch
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_57, negated_conjecture, (ndr1_0|~hskp11)).
% 0.14/0.38 cnf(i_0_58, negated_conjecture, (ndr1_0|~hskp10)).
% 0.14/0.38 cnf(i_0_59, negated_conjecture, (ndr1_0|~hskp9)).
% 0.14/0.38 cnf(i_0_60, negated_conjecture, (ndr1_0|~hskp8)).
% 0.14/0.38 cnf(i_0_61, negated_conjecture, (ndr1_0|~hskp7)).
% 0.14/0.38 cnf(i_0_62, negated_conjecture, (ndr1_0|~hskp6)).
% 0.14/0.38 cnf(i_0_63, negated_conjecture, (ndr1_0|~hskp5)).
% 0.14/0.38 cnf(i_0_64, negated_conjecture, (ndr1_0|~hskp4)).
% 0.14/0.38 cnf(i_0_65, negated_conjecture, (ndr1_0|~hskp3)).
% 0.14/0.38 cnf(i_0_66, negated_conjecture, (ndr1_0|~hskp2)).
% 0.14/0.38 cnf(i_0_67, negated_conjecture, (ndr1_0|~hskp1)).
% 0.14/0.38 cnf(i_0_68, negated_conjecture, (ndr1_0|~hskp0)).
% 0.14/0.38 cnf(i_0_92, negated_conjecture, (~c1_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_93, negated_conjecture, (~c2_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_94, negated_conjecture, (~c1_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_95, negated_conjecture, (~c0_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_69, negated_conjecture, (hskp2|hskp8|hskp9)).
% 0.14/0.38 cnf(i_0_70, negated_conjecture, (c2_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_96, negated_conjecture, (~c1_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_98, negated_conjecture, (~c2_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_97, negated_conjecture, (~c3_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_99, negated_conjecture, (~c3_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_73, negated_conjecture, (c2_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_100, negated_conjecture, (~c2_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_101, negated_conjecture, (~c2_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_102, negated_conjecture, (~c0_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_104, negated_conjecture, (~c0_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_77, negated_conjecture, (c2_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_79, negated_conjecture, (c2_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_103, negated_conjecture, (~c3_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_105, negated_conjecture, (~c1_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_81, negated_conjecture, (c2_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_91, negated_conjecture, (c2_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_71, negated_conjecture, (c0_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_83, negated_conjecture, (c0_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_86, negated_conjecture, (c0_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_72, negated_conjecture, (c3_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_74, negated_conjecture, (c3_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_75, negated_conjecture, (c3_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_76, negated_conjecture, (c3_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_78, negated_conjecture, (c3_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_88, negated_conjecture, (c3_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_90, negated_conjecture, (c3_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_80, negated_conjecture, (c1_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_82, negated_conjecture, (c1_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_84, negated_conjecture, (c1_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_85, negated_conjecture, (c1_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_87, negated_conjecture, (c1_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_89, negated_conjecture, (c1_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_107, negated_conjecture, (c0_1(X1)|c2_1(X1)|hskp10|hskp11|~c1_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_106, negated_conjecture, (c3_1(X1)|c0_1(X1)|hskp1|hskp5|~c2_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_108, negated_conjecture, (c0_1(X1)|hskp6|hskp7|~c1_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_111, negated_conjecture, (c1_1(X1)|c3_1(X1)|c2_1(X2)|hskp3|~c1_1(X2)|~c3_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_110, negated_conjecture, (c3_1(X1)|c3_1(X2)|c0_1(X1)|hskp0|~c1_1(X2)|~c1_1(X1)|~c2_1(X2)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_109, negated_conjecture, (c1_1(X1)|c0_1(X2)|c0_1(X1)|c2_1(X1)|hskp4|~c3_1(X2)|~c2_1(X2)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_112, negated_conjecture, (c3_1(X1)|c0_1(X2)|c0_1(X1)|c2_1(X2)|c2_1(X1)|~c1_1(X2)|~c3_1(X3)|~c0_1(X3)|~c2_1(X3)|~ndr1_0)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 3 steps
% 0.14/0.38 cnf(i_0_108, negated_conjecture, (c0_1(a53)|hskp6|hskp7|~c1_1(a53)|~c3_1(a53)|~ndr1_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_147, plain, (c0_1(a53)), inference(extension_rule, [i_0_104])).
% 0.14/0.38 cnf(i_0_361, plain, (~hskp1), inference(extension_rule, [i_0_106])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # 18395 Satisfiable branch
% 0.14/0.38 # Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_57, negated_conjecture, (ndr1_0|~hskp11)).
% 0.14/0.38 cnf(i_0_58, negated_conjecture, (ndr1_0|~hskp10)).
% 0.14/0.38 cnf(i_0_59, negated_conjecture, (ndr1_0|~hskp9)).
% 0.14/0.38 cnf(i_0_60, negated_conjecture, (ndr1_0|~hskp8)).
% 0.14/0.38 cnf(i_0_61, negated_conjecture, (ndr1_0|~hskp7)).
% 0.14/0.38 cnf(i_0_62, negated_conjecture, (ndr1_0|~hskp6)).
% 0.14/0.38 cnf(i_0_63, negated_conjecture, (ndr1_0|~hskp5)).
% 0.14/0.38 cnf(i_0_64, negated_conjecture, (ndr1_0|~hskp4)).
% 0.14/0.38 cnf(i_0_65, negated_conjecture, (ndr1_0|~hskp3)).
% 0.14/0.38 cnf(i_0_66, negated_conjecture, (ndr1_0|~hskp2)).
% 0.14/0.38 cnf(i_0_67, negated_conjecture, (ndr1_0|~hskp1)).
% 0.14/0.38 cnf(i_0_68, negated_conjecture, (ndr1_0|~hskp0)).
% 0.14/0.38 cnf(i_0_92, negated_conjecture, (~c1_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_93, negated_conjecture, (~c2_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_94, negated_conjecture, (~c1_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_95, negated_conjecture, (~c0_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_69, negated_conjecture, (hskp2|hskp8|hskp9)).
% 0.14/0.38 cnf(i_0_70, negated_conjecture, (c2_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_96, negated_conjecture, (~c1_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_98, negated_conjecture, (~c2_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_97, negated_conjecture, (~c3_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_99, negated_conjecture, (~c3_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_73, negated_conjecture, (c2_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_100, negated_conjecture, (~c2_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_101, negated_conjecture, (~c2_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_102, negated_conjecture, (~c0_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_104, negated_conjecture, (~c0_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_77, negated_conjecture, (c2_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_79, negated_conjecture, (c2_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_103, negated_conjecture, (~c3_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_105, negated_conjecture, (~c1_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_81, negated_conjecture, (c2_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_91, negated_conjecture, (c2_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_71, negated_conjecture, (c0_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_83, negated_conjecture, (c0_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_86, negated_conjecture, (c0_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_72, negated_conjecture, (c3_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_74, negated_conjecture, (c3_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_75, negated_conjecture, (c3_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_76, negated_conjecture, (c3_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_78, negated_conjecture, (c3_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_88, negated_conjecture, (c3_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_90, negated_conjecture, (c3_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_80, negated_conjecture, (c1_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_82, negated_conjecture, (c1_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_84, negated_conjecture, (c1_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_85, negated_conjecture, (c1_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_87, negated_conjecture, (c1_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_89, negated_conjecture, (c1_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_107, negated_conjecture, (c0_1(X1)|c2_1(X1)|hskp10|hskp11|~c1_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_106, negated_conjecture, (c3_1(X1)|c0_1(X1)|hskp1|hskp5|~c2_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_108, negated_conjecture, (c0_1(X1)|hskp6|hskp7|~c1_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_111, negated_conjecture, (c1_1(X1)|c3_1(X1)|c2_1(X2)|hskp3|~c1_1(X2)|~c3_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_110, negated_conjecture, (c3_1(X1)|c3_1(X2)|c0_1(X1)|hskp0|~c1_1(X2)|~c1_1(X1)|~c2_1(X2)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_109, negated_conjecture, (c1_1(X1)|c0_1(X2)|c0_1(X1)|c2_1(X1)|hskp4|~c3_1(X2)|~c2_1(X2)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_112, negated_conjecture, (c3_1(X1)|c0_1(X2)|c0_1(X1)|c2_1(X2)|c2_1(X1)|~c1_1(X2)|~c3_1(X3)|~c0_1(X3)|~c2_1(X3)|~ndr1_0)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 4 steps
% 0.14/0.38 cnf(i_0_106, negated_conjecture, (c3_1(a54)|c0_1(a54)|hskp1|hskp5|~c2_1(a54)|~ndr1_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_153, plain, (c3_1(a54)), inference(extension_rule, [i_0_97])).
% 0.14/0.38 cnf(i_0_373, plain, (~hskp6), inference(extension_rule, [i_0_108])).
% 0.14/0.38 cnf(i_0_412, plain, (~c3_1(a54)), inference(closure_rule, [i_0_153])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Bra# Satisfiable branch found.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 0 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_57, negated_conjecture, (ndr1_0|~hskp11)).
% 0.14/0.38 cnf(i_0_58, negated_conjecture, (ndr1_0|~hskp10)).
% 0.14/0.38 cnf(i_0_59, negated_conjecture, (ndr1_0|~hskp9)).
% 0.14/0.38 cnf(i_0_60, negated_conjecture, (ndr1_0|~hskp8)).
% 0.14/0.38 cnf(i_0_61, negated_conjecture, (ndr1_0|~hskp7)).
% 0.14/0.38 cnf(i_0_62, negated_conjecture, (ndr1_0|~hskp6)).
% 0.14/0.38 cnf(i_0_63, negated_conjecture, (ndr1_0|~hskp5)).
% 0.14/0.38 cnf(i_0_64, negated_conjecture, (ndr1_0|~hskp4)).
% 0.14/0.38 cnf(i_0_65, negated_conjecture, (ndr1_0|~hskp3)).
% 0.14/0.38 cnf(i_0_66, negated_conjecture, (ndr1_0|~hskp2)).
% 0.14/0.38 cnf(i_0_67, negated_conjecture, (ndr1_0|~hskp1)).
% 0.14/0.38 cnf(i_0_68, negated_conjecture, (ndr1_0|~hskp0)).
% 0.14/0.38 cnf(i_0_92, negated_conjecture, (~c1_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_93, negated_conjecture, (~c2_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_94, negated_conjecture, (~c1_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_95, negated_conjecture, (~c0_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_69, negated_conjecture, (hskp2|hskp8|hskp9)).
% 0.14/0.38 cnf(i_0_70, negated_conjecture, (c2_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_96, negated_conjecture, (~c1_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_98, negated_conjecture, (~c2_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_97, negated_conjecture, (~c3_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_99, negated_conjecture, (~c3_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_73, negated_conjecture, (c2_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_100, negated_conjecture, (~c2_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_101, negated_conjecture, (~c2_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_102, negated_conjecture, (~c0_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_104, negated_conjecture, (~c0_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_77, negated_conjecture, (c2_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_79, negated_conjecture, (c2_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_103, negated_conjecture, (~c3_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_105, negated_conjecture, (~c1_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_81, negated_conjecture, (c2_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_91, negated_conjecture, (c2_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_71, negated_conjecture, (c0_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_83, negated_conjecture, (c0_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_86, negated_conjecture, (c0_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_72, negated_conjecture, (c3_1(a60)|~hskp11)).
% 0.14/0.38 cnf(i_0_74, negated_conjecture, (c3_1(a59)|~hskp10)).
% 0.14/0.38 cnf(i_0_75, negated_conjecture, (c3_1(a57)|~hskp9)).
% 0.14/0.38 cnf(i_0_76, negated_conjecture, (c3_1(a56)|~hskp8)).
% 0.14/0.38 cnf(i_0_78, negated_conjecture, (c3_1(a55)|~hskp7)).
% 0.14/0.38 cnf(i_0_88, negated_conjecture, (c3_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_90, negated_conjecture, (c3_1(a49)|~hskp0)).
% 0.14/0.38 cnf(i_0_80, negated_conjecture, (c1_1(a54)|~hskp6)).
% 0.14/0.38 cnf(i_0_82, negated_conjecture, (c1_1(a52)|~hskp5)).
% 0.14/0.38 cnf(i_0_84, negated_conjecture, (c1_1(a51)|~hskp4)).
% 0.14/0.38 cnf(i_0_85, negated_conjecture, (c1_1(a50)|~hskp3)).
% 0.14/0.38 cnf(i_0_87, negated_conjecture, (c1_1(a58)|~hskp2)).
% 0.14/0.38 cnf(i_0_89, negated_conjecture, (c1_1(a53)|~hskp1)).
% 0.14/0.38 cnf(i_0_107, negated_conjecture, (c0_1(X1)|c2_1(X1)|hskp10|hskp11|~c1_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_106, negated_conjecture, (c3_1(X1)|c0_1(X1)|hskp1|hskp5|~c2_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_108, negated_conjecture, (c0_1(X1)|hskp6|hskp7|~c1_1(X1)|~c3_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_111, negated_conjecture, (c1_1(X1)|c3_1(X1)|c2_1(X2)|hskp3|~c1_1(X2)|~c3_1(X2)|~c2_1(X1)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_110, negated_conjecture, (c3_1(X1)|c3_1(X2)|c0_1(X1)|hskp0|~c1_1(X2)|~c1_1(X1)|~c2_1(X2)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_109, negated_conjecture, (c1_1(X1)|c0_1(X2)|c0_1(X1)|c2_1(X1)|hskp4|~c3_1(X2)|~c2_1(X2)|~ndr1_0)).
% 0.14/0.38 cnf(i_0_112, negated_conjecture, (c3_1(X1)|c0_1(X2)|c0_1(X1)|c2_1(X2)|c2_1(X1)|~c1_1(X2)|~c3_1(X3)|~c0_1(X3)|~c2_1(X3)|~ndr1_0)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 3 steps
% 0.14/0.38 cnf(i_0_107, negated_conjecture, (c0_1(a53)|c2_1(a53)|hskp10|hskp11|~c1_1(a53)|~ndr1_0), inference(start_rule)).
% 0.14/0.38 cnf(i_0_159, plain, (c0_1(a53)), inference(extension_rule, [i_0_104])).
% 0.14/0.38 cnf(i_0_361, plain, (~hskp1), inference(extension_rule, [i_0_106])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (18393) has found a proof.
% 0.14/0.38
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------