TSTP Solution File: SYN523-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN523-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 : 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 : Thu Jul 21 06:12:03 EDT 2022
% Result : Satisfiable 0.18s 0.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN523-1 : TPTP v8.1.0. Released v2.1.0.
% 0.00/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 : n018.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 : Mon Jul 11 22:01:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.18/0.36 # and selection function SelectComplexAHPExceptRRHorn.
% 0.18/0.36 #
% 0.18/0.36 # Number of axioms: 55 Number of unprocessed: 55
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 55 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 55 conjectures.
% 0.18/0.36 # There are 55 start rule candidates:
% 0.18/0.36 # Found 0 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 55 start rule tableaux created.
% 0.18/0.36 # 55 extension rule candidate clauses
% 0.18/0.36 # 0 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # 4390 Satisfiable branch
% 0.18/0.37 # 4388 Satisfiable branch
% 0.18/0.37 # 4387 Satisfiable branch
% 0.18/0.37 # Satisfiable branch found.
% 0.18/0.37 # There were 1 total branch saturation attempts.
% 0.18/0.37 # There were 0 of these attempts blocked.
% 0.18/0.37 # There were 0 deferred branch saturation attempts.
% 0.18/0.37 # There were 0 free duplicated saturations.
% 0.18/0.37 # There were 0 total successful branch saturations.
% 0.18/0.37 # There were 0 successful branch saturations in interreduction.
% 0.18/0.37 # There were 0 successful branch saturations on the branch.
% 0.18/0.37 # There were 0 successful branch saturations after the branch.
% 0.18/0.37 # Satisfiable branch found.
% 0.18/0.37 # There were 1 total branch saturation attempts.
% 0.18/0.37 # There were 0 of these attempts blocked.
% 0.18/0.37 # There were 0 deferred branch saturation attempts.
% 0.18/0.37 # There were 0 free duplicated saturations.
% 0.18/0.37 # There were 0 total successful branch saturations.
% 0.18/0.37 # There were 0 successful branch saturations in interreduction.
% 0.18/0.37 # There were 0 successful branch saturations on the branch.
% 0.18/0.37 # There were 0 successful branch saturations after the branch.
% 0.18/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 # Begin clausification derivation
% 0.18/0.37
% 0.18/0.37 # End clausification derivation
% 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.37 cnf(i_0_56, negated_conjecture, (ndr1_0|c2_0)).
% 0.18/0.37 cnf(i_0_57, negated_conjecture, (ndr1_0|ssSkC3)).
% 0.18/0.37 cnf(i_0_58, negated_conjecture, (ndr1_0|ssSkC1)).
% 0.18/0.37 cnf(i_0_60, negated_conjecture, (ndr1_0|~c3_0)).
% 0.18/0.37 cnf(i_0_63, negated_conjecture, (ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_64, negated_conjecture, (c2_0|c5_0|c1_0)).
% 0.18/0.37 cnf(i_0_59, negated_conjecture, (ndr1_0|c3_0|~ssSkC3)).
% 0.18/0.37 cnf(i_0_61, negated_conjecture, (ndr1_0|c3_0|~ssSkC2)).
% 0.18/0.37 cnf(i_0_70, negated_conjecture, (ndr1_0|~c2_0|~ssSkC0)).
% 0.18/0.37 cnf(i_0_78, negated_conjecture, (ndr1_0|~c5_0|~c1_0)).
% 0.18/0.37 cnf(i_0_62, negated_conjecture, (c2_0|c3_1(a145))).
% 0.18/0.37 cnf(i_0_65, negated_conjecture, (ssSkC1|c4_1(a146))).
% 0.18/0.37 cnf(i_0_69, negated_conjecture, (c5_1(a144)|~c4_0)).
% 0.18/0.37 cnf(i_0_67, negated_conjecture, (c3_0|c1_1(a154)|~ssSkC3)).
% 0.18/0.37 cnf(i_0_83, negated_conjecture, (c5_1(a148)|~c5_0|~c1_0)).
% 0.18/0.37 cnf(i_0_68, negated_conjecture, (c2_0|~c5_1(a145))).
% 0.18/0.37 cnf(i_0_71, negated_conjecture, (ssSkC3|~c1_1(a153))).
% 0.18/0.37 cnf(i_0_72, negated_conjecture, (ssSkC3|~c5_1(a153))).
% 0.18/0.37 cnf(i_0_73, negated_conjecture, (ssSkC1|~c3_1(a146))).
% 0.18/0.37 cnf(i_0_76, negated_conjecture, (~c3_0|~c3_1(a151))).
% 0.18/0.37 cnf(i_0_75, negated_conjecture, (~c3_0|~c2_1(a151))).
% 0.18/0.37 cnf(i_0_79, negated_conjecture, (~c4_0|~c4_1(a144))).
% 0.18/0.37 cnf(i_0_74, negated_conjecture, (c3_0|~ssSkC3|~c5_1(a154))).
% 0.18/0.37 cnf(i_0_77, negated_conjecture, (c3_0|~ssSkC2|~c4_1(a150))).
% 0.18/0.37 cnf(i_0_84, negated_conjecture, (~c2_0|~ssSkC0|~c1_1(a143))).
% 0.18/0.37 cnf(i_0_85, negated_conjecture, (~c5_0|~c1_0|~c3_1(a148))).
% 0.18/0.37 cnf(i_0_86, negated_conjecture, (~c5_0|~c1_0|~c2_1(a148))).
% 0.18/0.37 cnf(i_0_66, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))).
% 0.18/0.37 cnf(i_0_87, negated_conjecture, (c4_0|ndr1_1(X1)|c5_1(X1)|~ndr1_0|~ssSkC1)).
% 0.18/0.37 cnf(i_0_88, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|c3_1(a152)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_90, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|ndr1_1(X1)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_91, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|~ndr1_0|~c4_1(a152))).
% 0.18/0.37 cnf(i_0_92, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|~ndr1_0|~c1_1(a152))).
% 0.18/0.37 cnf(i_0_99, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|ndr1_1(a155)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_89, negated_conjecture, (c4_0|c5_1(X1)|c3_2(X1,a147)|~ndr1_0|~ssSkC1)).
% 0.18/0.37 cnf(i_0_97, negated_conjecture, (ssSkC0|ndr1_1(X1)|~ndr1_0|~ssSkP0(X1)|~c1_1(X1))).
% 0.18/0.37 cnf(i_0_105, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|~ndr1_0|~c4_0|~c4_1(a155))).
% 0.18/0.37 cnf(i_0_95, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|c5_2(X1,a149)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_96, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|c4_2(X1,a149)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_80, negated_conjecture, (ssSkP0(X1)|~c2_2(X1,a141))).
% 0.18/0.37 cnf(i_0_81, negated_conjecture, (ssSkP0(X1)|~c5_2(X1,a141))).
% 0.18/0.37 cnf(i_0_82, negated_conjecture, (ssSkP0(X1)|~c1_2(X1,a141))).
% 0.18/0.37 cnf(i_0_104, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c2_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_103, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c5_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_102, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c1_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_94, negated_conjecture, (c4_0|c5_1(X1)|~ndr1_0|~ssSkC1|~c5_2(X1,a147))).
% 0.18/0.37 cnf(i_0_93, negated_conjecture, (c4_0|c5_1(X1)|~ndr1_0|~ssSkC1|~c1_2(X1,a147))).
% 0.18/0.37 cnf(i_0_98, negated_conjecture, (ssSkC0|c3_2(X1,a142)|~ndr1_0|~ssSkP0(X1)|~c1_1(X1))).
% 0.18/0.37 cnf(i_0_101, negated_conjecture, (ssSkC0|~ndr1_0|~ssSkP0(X1)|~c1_1(X1)|~c4_2(X1,a142))).
% 0.18/0.37 cnf(i_0_100, negated_conjecture, (c3_0|c5_2(a150,X1)|~ssSkC2|~ndr1_1(a150)|~c4_2(a150,X1))).
% 0.18/0.37 cnf(i_0_106, negated_conjecture, (c3_0|~ssSkC3|~ndr1_1(a154)|~c5_2(a154,X1)|~c1_2(a154,X1))).
% 0.18/0.37 cnf(i_0_107, negated_conjecture, (c3_2(a144,X1)|c4_2(a144,X1)|~c4_0|~ndr1_1(a144)|~c5_2(a144,X1))).
% 0.18/0.37 cnf(i_0_109, negated_conjecture, (c1_2(X1,X2)|c4_2(X1,X2)|~ndr1_0|~c1_0|~c3_1(X1)|~ndr1_1(X1)|~c5_1(X1))).
% 0.18/0.37 cnf(i_0_108, negated_conjecture, (c2_0|~ndr1_1(a145)|~c2_2(a145,X1)|~c5_2(a145,X1)|~c1_2(a145,X1))).
% 0.18/0.37 cnf(i_0_110, negated_conjecture, (c4_1(X2)|c1_1(X2)|c5_1(X2)|c5_2# SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 # Begin clausification derivation
% 0.18/0.37
% 0.18/0.37 # End clausification derivation
% 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.37 cnf(i_0_56, negated_conjecture, (ndr1_0|c2_0)).
% 0.18/0.37 cnf(i_0_57, negated_conjecture, (ndr1_0|ssSkC3)).
% 0.18/0.37 cnf(i_0_58, negated_conjecture, (ndr1_0|ssSkC1)).
% 0.18/0.37 cnf(i_0_60, negated_conjecture, (ndr1_0|~c3_0)).
% 0.18/0.37 cnf(i_0_63, negated_conjecture, (ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_64, negated_conjecture, (c2_0|c5_0|c1_0)).
% 0.18/0.37 cnf(i_0_59, negated_conjecture, (ndr1_0|c3_0|~ssSkC3)).
% 0.18/0.37 cnf(i_0_61, negated_conjecture, (ndr1_0|c3_0|~ssSkC2)).
% 0.18/0.37 cnf(i_0_70, negated_conjecture, (ndr1_0|~c2_0|~ssSkC0)).
% 0.18/0.37 cnf(i_0_78, negated_conjecture, (ndr1_0|~c5_0|~c1_0)).
% 0.18/0.37 cnf(i_0_62, negated_conjecture, (c2_0|c3_1(a145))).
% 0.18/0.37 cnf(i_0_65, negated_conjecture, (ssSkC1|c4_1(a146))).
% 0.18/0.37 cnf(i_0_69, negated_conjecture, (c5_1(a144)|~c4_0)).
% 0.18/0.37 cnf(i_0_67, negated_conjecture, (c3_0|c1_1(a154)|~ssSkC3)).
% 0.18/0.37 cnf(i_0_83, negated_conjecture, (c5_1(a148)|~c5_0|~c1_0)).
% 0.18/0.37 cnf(i_0_68, negated_conjecture, (c2_0|~c5_1(a145))).
% 0.18/0.37 cnf(i_0_71, negated_conjecture, (ssSkC3|~c1_1(a153))).
% 0.18/0.37 cnf(i_0_72, negated_conjecture, (ssSkC3|~c5_1(a153))).
% 0.18/0.37 cnf(i_0_73, negated_conjecture, (ssSkC1|~c3_1(a146))).
% 0.18/0.37 cnf(i_0_76, negated_conjecture, (~c3_0|~c3_1(a151))).
% 0.18/0.37 cnf(i_0_75, negated_conjecture, (~c3_0|~c2_1(a151))).
% 0.18/0.37 cnf(i_0_79, negated_conjecture, (~c4_0|~c4_1(a144))).
% 0.18/0.37 cnf(i_0_74, negated_conjecture, (c3_0|~ssSkC3|~c5_1(a154))).
% 0.18/0.37 cnf(i_0_77, negated_conjecture, (c3_0|~ssSkC2|~c4_1(a150))).
% 0.18/0.37 cnf(i_0_84, negated_conjecture, (~c2_0|~ssSkC0|~c1_1(a143))).
% 0.18/0.37 cnf(i_0_85, negated_conjecture, (~c5_0|~c1_0|~c3_1(a148))).
% 0.18/0.37 cnf(i_0_86, negated_conjecture, (~c5_0|~c1_0|~c2_1(a148))).
% 0.18/0.37 cnf(i_0_66, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))).
% 0.18/0.37 cnf(i_0_87, negated_conjecture, (c4_0|ndr1_1(X1)|c5_1(X1)|~ndr1_0|~ssSkC1)).
% 0.18/0.37 cnf(i_0_88, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|c3_1(a152)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_90, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|ndr1_1(X1)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_91, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|~ndr1_0|~c4_1(a152))).
% 0.18/0.37 cnf(i_0_92, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|~ndr1_0|~c1_1(a152))).
% 0.18/0.37 cnf(i_0_99, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|ndr1_1(a155)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_89, negated_conjecture, (c4_0|c5_1(X1)|c3_2(X1,a147)|~ndr1_0|~ssSkC1)).
% 0.18/0.37 cnf(i_0_97, negated_conjecture, (ssSkC0|ndr1_1(X1)|~ndr1_0|~ssSkP0(X1)|~c1_1(X1))).
% 0.18/0.37 cnf(i_0_105, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|~ndr1_0|~c4_0|~c4_1(a155))).
% 0.18/0.37 cnf(i_0_95, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|c5_2(X1,a149)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_96, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|c4_2(X1,a149)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_80, negated_conjecture, (ssSkP0(X1)|~c2_2(X1,a141))).
% 0.18/0.37 cnf(i_0_81, negated_conjecture, (ssSkP0(X1)|~c5_2(X1,a141))).
% 0.18/0.37 cnf(i_0_82, negated_conjecture, (ssSkP0(X1)|~c1_2(X1,a141))).
% 0.18/0.37 cnf(i_0_104, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c2_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_103, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c5_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_102, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c1_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_94, negated_conjecture, (c4_0|c5_1(X1)|~ndr1_0|~ssSkC1|~c5_2(X1,a147))).
% 0.18/0.37 cnf(i_0_93, negated_conjecture, (c4_0|c5_1(X1)|~ndr1_0|~ssSkC1|~c1_2(X1,a147))).
% 0.18/0.37 cnf(i_0_98, negated_conjecture, (ssSkC0|c3_2(X1,a142)|~ndr1_0|~ssSkP0(X1)|~c1_1(X1))).
% 0.18/0.37 cnf(i_0_101, negated_conjecture, (ssSkC0|~ndr1_0|~ssSkP0(X1)|~c1_1(X1)|~c4_2(X1,a142))).
% 0.18/0.37 cnf(i_0_100, negated_conjecture, (c3_0|c5_2(a150,X1)|~ssSkC2|~ndr1_1(a150)|~c4_2(a150,X1))).
% 0.18/0.37 cnf(i_0_106, negated_conjecture, (c3_0|~ssSkC3|~ndr1_1(a154)|~c5_2(a154,X1)|~c1_2(a154,X1))).
% 0.18/0.37 cnf(i_0_107, negated_conjecture, (c3_2(a144,X1)|c4_2(a144,X1)|~c4_0|~ndr1_1(a144)|~c5_2(a144,X1))).
% 0.18/0.37 cnf(i_0_109, negated_conjecture, (c1_2(X1,X2)|c4_2(X1,X2)|~ndr1_0|~c1_0|~c3_1(X1)|~ndr1_1(X1)|~c5_1(X1))).
% 0.18/0.37 cnf(i_0_108, negated_conjecture, (c2_0|~ndr1_1(a145)|~c2_2(a145,X1)|~c5_2(a145,X1)|~c1_2(a145,X1))).
% 0.18/0.37 cnf(i_0_110, negated_conjecture, (c4_1(X2)|c1_1(X2)|c5_1(X2)|c5_2(a155,X1)|~ndr1_0|~c4_0|~ndr1_1(a155)|~c2_2(a155,X1)|~c4_2(a155,X1))).
% 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.37 # Begin printing tableau
% 0.18/0.37 # Found 3 steps
% 0.18/0.37 cnf(i_0_103, negated_conjecture, (c4_1(a150)|c1_1(a150)|c5_1(a150)|c5_2(a155,a156)|~ndr1_0|~c4_0), inference(start_rule)).
% 0.18/0.37 cnf(i_0_173, plain, (c4_1(a150)), inference(extension_rule, [i_0_77])).
% 0.18/0.37 cnf(i_0_669, plain, (c3_0), inference(extension_rule, [i_0_75])).
% 0.18/0.37 # End printing tableau
% 0.18/0.37 # SZS output end
% 0.18/0.37 # Branches closed with saturation will be marked with an "s"
% 0.18/0.37 # Satisfiable branch found.
% 0.18/0.37 # There were 1 total branch saturation attempts.
% 0.18/0.37 # There were 0 of these attempts blocked.
% 0.18/0.37 # There were 0 deferred branch saturation attempts.
% 0.18/0.37 # There were 0 free duplicated saturations.
% 0.18/0.37 # There were 0 total successful branch saturations.
% 0.18/0.37 # There were 0 successful branch saturations in interreduction.
% 0.18/0.37 # There were 0 successful branch saturations on the branch.
% 0.18/0.37 # There were 0 successful branch saturations after the branch.
% 0.18/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 # Begin clausification derivation
% 0.18/0.37
% 0.18/0.37 # End clausification derivation
% 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.37 cnf(i_0_56, negated_conjecture, (ndr1_0|c2_0)).
% 0.18/0.37 cnf(i_0_57, negated_conjecture, (ndr1_0|ssSkC3)).
% 0.18/0.37 cnf(i_0_58, negated_conjecture, (ndr1_0|ssSkC1)).
% 0.18/0.37 cnf(i_0_60, negated_conjecture, (ndr1_0|~c3_0)).
% 0.18/0.37 cnf(i_0_63, negated_conjecture, (ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_64, negated_conjecture, (c2_0|c5_0|c1_0)).
% 0.18/0.37 cnf(i_0_59, negated_conjecture, (ndr1_0|c3_0|~ssSkC3)).
% 0.18/0.37 cnf(i_0_61, negated_conjecture, (ndr1_0|c3_0|~ssSkC2)).
% 0.18/0.37 cnf(i_0_70, negated_conjecture, (ndr1_0|~c2_0|~ssSkC0)).
% 0.18/0.37 cnf(i_0_78, negated_conjecture, (ndr1_0|~c5_0|~c1_0)).
% 0.18/0.37 cnf(i_0_62, negated_conjecture, (c2_0|c3_1(a145))).
% 0.18/0.37 cnf(i_0_65, negated_conjecture, (ssSkC1|c4_1(a146))).
% 0.18/0.37 cnf(i_0_69, negated_conjecture, (c5_1(a144)|~c4_0)).
% 0.18/0.37 cnf(i_0_67, negated_conjecture, (c3_0|c1_1(a154)|~ssSkC3)).
% 0.18/0.37 cnf(i_0_83, negated_conjecture, (c5_1(a148)|~c5_0|~c1_0)).
% 0.18/0.37 cnf(i_0_68, negated_conjecture, (c2_0|~c5_1(a145))).
% 0.18/0.37 cnf(i_0_71, negated_conjecture, (ssSkC3|~c1_1(a153))).
% 0.18/0.37 cnf(i_0_72, negated_conjecture, (ssSkC3|~c5_1(a153))).
% 0.18/0.37 cnf(i_0_73, negated_conjecture, (ssSkC1|~c3_1(a146))).
% 0.18/0.37 cnf(i_0_76, negated_conjecture, (~c3_0|~c3_1(a151))).
% 0.18/0.37 cnf(i_0_75, negated_conjecture, (~c3_0|~c2_1(a151))).
% 0.18/0.37 cnf(i_0_79, negated_conjecture, (~c4_0|~c4_1(a144))).
% 0.18/0.37 cnf(i_0_74, negated_conjecture, (c3_0|~ssSkC3|~c5_1(a154))).
% 0.18/0.37 cnf(i_0_77, negated_conjecture, (c3_0|~ssSkC2|~c4_1(a150))).
% 0.18/0.37 cnf(i_0_84, negated_conjecture, (~c2_0|~ssSkC0|~c1_1(a143))).
% 0.18/0.37 cnf(i_0_85, negated_conjecture, (~c5_0|~c1_0|~c3_1(a148))).
% 0.18/0.37 cnf(i_0_86, negated_conjecture, (~c5_0|~c1_0|~c2_1(a148))).
% 0.18/0.37 cnf(i_0_66, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))).
% 0.18/0.37 cnf(i_0_87, negated_conjecture, (c4_0|ndr1_1(X1)|c5_1(X1)|~ndr1_0|~ssSkC1)).
% 0.18/0.37 cnf(i_0_88, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|c3_1(a152)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_90, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|ndr1_1(X1)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_91, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|~ndr1_0|~c4_1(a152))).
% 0.18/0.37 cnf(i_0_92, negated_conjecture, (c2_0|c4_1(X1)|c5_1(X1)|~ndr1_0|~c1_1(a152))).
% 0.18/0.37 cnf(i_0_99, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|ndr1_1(a155)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_89, negated_conjecture, (c4_0|c5_1(X1)|c3_2(X1,a147)|~ndr1_0|~ssSkC1)).
% 0.18/0.37 cnf(i_0_97, negated_conjecture, (ssSkC0|ndr1_1(X1)|~ndr1_0|~ssSkP0(X1)|~c1_1(X1))).
% 0.18/0.37 cnf(i_0_105, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|~ndr1_0|~c4_0|~c4_1(a155))).
% 0.18/0.37 cnf(i_0_95, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|c5_2(X1,a149)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_96, negated_conjecture, (ssSkC2|c3_1(X1)|c4_1(X1)|c4_2(X1,a149)|~ndr1_0)).
% 0.18/0.37 cnf(i_0_80, negated_conjecture, (ssSkP0(X1)|~c2_2(X1,a141))).
% 0.18/0.37 cnf(i_0_81, negated_conjecture, (ssSkP0(X1)|~c5_2(X1,a141))).
% 0.18/0.37 cnf(i_0_82, negated_conjecture, (ssSkP0(X1)|~c1_2(X1,a141))).
% 0.18/0.37 cnf(i_0_104, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c2_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_103, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c5_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_102, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(X1)|c1_2(a155,a156)|~ndr1_0|~c4_0)).
% 0.18/0.37 cnf(i_0_94, negated_conjecture, (c4_0|c5_1(X1)|~ndr1_0|~ssSkC1|~c5_2(X1,a147))).
% 0.18/0.37 cnf(i_0_93, negated_conjecture, (c4_0|c5_1(X1)|~ndr1_0|~ssSkC1|~c1_2(X1,a147))).
% 0.18/0.37 cnf(i_0_98, negated_conjecture, (ssSkC0|c3_2(X1,a142)|~ndr1_0|~ssSkP0(X1)|~c1_1(X1))).
% 0.18/0.37 cnf(i_0_101, negated_conjecture, (ssSkC0|~ndr1_0|~ssSkP0(X1)|~c1_1(X1)|~c4_2(X1,a142))).
% 0.18/0.37 cnf(i_0_100, negated_conjecture, (c3_0|c5_2(a150,X1)|~ssSkC2|~ndr1_1(a150)|~c4_2(a150,X1))).
% 0.18/0.37 cnf(i_0_106, negated_conjecture, (c3_0|~ssSkC3|~ndr1_1(a154)|~c5_2(a154,X1)|~c1_2(a154,X1))).
% 0.18/0.37 cnf(i_0_107, negated_conjecture, (c3_2(a144,X1)|c4_2(a144,X1)|~c4_0|~ndr1_1(a144)|~c5_2(a144,X1))).
% 0.18/0.37 cnf(i_0_109, negated_conjecture, (c1_2(X1,X2)|c4_2(X1,X2)|~ndr1_0|~c1_0|~c3_1(X1)|~ndr1_1(X1)|~c5_1(X1))).
% 0.18/0.37 cnf(i_0_108, negated_conjecture, (c2_0|~ndr1_1(a145)|~c2_2(a145,X1)|~c5_2(a145,X1)|~c1_2(a145,X1))).
% 0.18/0.37 cnf(i_0_110, negated_conjecture, (c4_1(X2)|c1_1(X2)|c5_1(X2)|c5_2(a155,X1)|~ndr1_0|~c4_0|~ndr1_1(a155)|~c2_2(a155,X1)|~c4_2(a155,X1))).
% 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.37 # Begin printing tableau
% 0.18/0.37 # Found 6 steps
% 0.18/0.37 cnf(i_0_109, negated_conjecture, (c1_2(a154,a141)|c4_2(a154,a141)|~ndr1_0|~c1_0|~c3_1(a154)|~ndr1_1(a154)|~c5_1(a154)), inference(start_rule)).
% 0.18/0.37 cnf(i_0_125, plain, (c1_2(a154,a141)), inference(extension_rule, [i_0_82])).
% 0.18/0.37 cnf(i_0_390, plain, (ssSkP0(a154)), inference(extension_rule, [i_0_101])).
% 0.18/0.37 cnf(i_0_428, plain, (ssSkC0), inference(extension_rule, [i_0_84])).
% 0.18/0.37 cnf(i_0_429, plain, (~ndr1_0), inference(extension_rule, [i_0_78])).
% 0.18/0.37 cnf(i_0_431, plain, (~c1_1(a154)), inference(extension_rule, [i_0_67])).
% 0.18/0.37 # End printing tableau
% 0.18/0.37 # SZS output end
% 0.18/0.37 # Branches closed with saturation will be marked with an "s"
% 0.18/0.37 (a155,X1)|~ndr1_0|~c4_0|~ndr1_1(a155)|~c2_2(a155,X1)|~c4_2(a155,X1))).
% 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.37 # Begin printing tableau
% 0.18/0.37 # Found 4 steps
% 0.18/0.37 cnf(i_0_100, negated_conjecture, (c3_0|c5_2(a150,a147)|~ssSkC2|~ndr1_1(a150)|~c4_2(a150,a147)), inference(start_rule)).
% 0.18/0.37 cnf(i_0_142, plain, (c3_0), inference(closure_rule, [i_0_0])).
% 0.18/0.37 cnf(i_0_143, plain, (c5_2(a150,a147)), inference(extension_rule, [i_0_94])).
% 0.18/0.37 cnf(i_0_730, plain, (c4_0), inference(extension_rule, [i_0_107])).
% 0.18/0.37 # End printing tableau
% 0.18/0.37 # SZS output end
% 0.18/0.37 # Branches closed with saturation will be marked with an "s"
% 0.18/0.37 # Child (4388) has found a proof.
% 0.18/0.37
% 0.18/0.37 # Proof search is over...
% 0.18/0.37 # Freeing feature tree
%------------------------------------------------------------------------------