%------------------------------------------------------------------------------ % 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 : n026.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:04 EDT 2022 % Result : CounterSatisfiable 0.22s 0.40s % Output : CNFRefutation 0.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SYN523+1 : TPTP v8.1.0. Released v2.1.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.15/0.35 % Computer : n026.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 600 % 0.15/0.36 % DateTime : Mon Jul 11 16:53:57 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.39 # No SInE strategy applied % 0.15/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S % 0.15/0.39 # and selection function SelectComplexG. % 0.15/0.39 # % 0.15/0.39 # Presaturation interreduction done % 0.15/0.39 # Number of axioms: 64 Number of unprocessed: 50 % 0.15/0.39 # Tableaux proof search. % 0.15/0.39 # APR header successfully linked. % 0.15/0.39 # Hello from C++ % 0.15/0.39 # The folding up rule is enabled... % 0.15/0.39 # Local unification is enabled... % 0.15/0.39 # Any saturation attempts will use folding labels... % 0.15/0.39 # 50 beginning clauses after preprocessing and clausification % 0.15/0.39 # Creating start rules for all 50 conjectures. % 0.15/0.39 # There are 50 start rule candidates: % 0.15/0.39 # Found 1 unit axioms. % 0.15/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.39 # 50 start rule tableaux created. % 0.15/0.39 # 49 extension rule candidate clauses % 0.15/0.39 # 1 unit axiom clauses % 0.15/0.39 % 0.15/0.39 # Requested 8, 32 cores available to the main process. % 0.22/0.40 # 32211 Satisfiable branch % 0.22/0.40 # 32213 Satisfiable branch % 0.22/0.40 # Satisfiable branch found. % 0.22/0.40 # There were 1 total branch saturation attempts. % 0.22/0.40 # There were 0 of these attempts blocked. % 0.22/0.40 # There were 0 deferred branch saturation attempts. % 0.22/0.40 # There were 0 free duplicated saturations. % 0.22/0.40 # There were 0 total successful branch saturations. % 0.22/0.40 # There were 0 successful branch saturations in interreduction. % 0.22/0.40 # There were 0 successful branch saturations on the branch. % 0.22/0.40 # There were 0 successful branch saturations after the branch. % 0.22/0.40 # Satisfiable branch found. % 0.22/0.40 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.40 # Begin clausification derivation % 0.22/0.40 % 0.22/0.40 # End clausification derivation % 0.22/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.40 cnf(i_0_19, negated_conjecture, (ndr1_0)). % 0.22/0.40 cnf(i_0_57, negated_conjecture, (~c4_1(a144)|~c4_0)). % 0.22/0.40 cnf(i_0_24, negated_conjecture, (~c3_0|~c3_1(a151))). % 0.22/0.40 cnf(i_0_53, negated_conjecture, (c3_1(a145)|c2_0)). % 0.22/0.40 cnf(i_0_25, negated_conjecture, (~c3_0|~c2_1(a151))). % 0.22/0.40 cnf(i_0_52, negated_conjecture, (c2_0|~c5_1(a145))). % 0.22/0.40 cnf(i_0_37, negated_conjecture, (~c3_1(a148)|~c1_0|~c5_0)). % 0.22/0.40 cnf(i_0_58, negated_conjecture, (c5_1(a144)|~c4_0)). % 0.22/0.40 cnf(i_0_36, negated_conjecture, (~c2_1(a148)|~c1_0|~c5_0)). % 0.22/0.40 cnf(i_0_61, negated_conjecture, (c1_0|c5_0|c2_0)). % 0.22/0.40 cnf(i_0_38, negated_conjecture, (c5_1(a148)|~c1_0|~c5_0)). % 0.22/0.40 cnf(i_0_14, negated_conjecture, (c3_0|~c5_1(a154)|~c1_1(a153))). % 0.22/0.40 cnf(i_0_10, negated_conjecture, (c3_0|~c5_1(a153)|~c5_1(a154))). % 0.22/0.40 cnf(i_0_13, negated_conjecture, (c3_0|c1_1(a154)|~c1_1(a153))). % 0.22/0.40 cnf(i_0_9, negated_conjecture, (c3_0|c1_1(a154)|~c5_1(a153))). % 0.22/0.40 cnf(i_0_12, negated_conjecture, (c3_0|~c1_1(a153)|~c1_2(a154,X1)|~c5_2(a154,X1)|~ndr1_1(a154))). % 0.22/0.40 cnf(i_0_8, negated_conjecture, (c3_0|~c5_1(a153)|~c1_2(a154,X1)|~c5_2(a154,X1)|~ndr1_1(a154))). % 0.22/0.40 cnf(i_0_45, negated_conjecture, (c5_1(X1)|c4_0|~c3_1(a146)|~c1_2(X1,a147))). % 0.22/0.40 cnf(i_0_20, negated_conjecture, (c3_1(a152)|c4_1(X1)|c5_1(X1)|c2_0)). % 0.22/0.40 cnf(i_0_43, negated_conjecture, (c4_1(a146)|c5_1(X1)|c4_0|ndr1_1(X1))). % 0.22/0.40 cnf(i_0_84, negated_conjecture, (ndr1_1(X1)|~c2_0|~c1_1(a143)|~c1_1(X1))). % 0.22/0.40 cnf(i_0_74, negated_conjecture, (~c2_0|~c1_1(a143)|~c1_1(X1)|~c4_2(X1,a142)|~c2_2(X1,a141))). % 0.22/0.40 cnf(i_0_68, negated_conjecture, (~c2_0|~c1_1(a143)|~c1_1(X1)|~c4_2(X1,a142)|~c5_2(X1,a141))). % 0.22/0.40 cnf(i_0_62, negated_conjecture, (~c2_0|~c1_1(a143)|~c1_1(X1)|~c4_2(X1,a142)|~c1_2(X1,a141))). % 0.22/0.40 cnf(i_0_21, negated_conjecture, (c4_1(X1)|c5_1(X1)|c2_0|~c1_1(a152))). % 0.22/0.40 cnf(i_0_40, negated_conjecture, (c4_1(a146)|c5_1(X1)|c4_0|~c5_2(X1,a147))). % 0.22/0.40 cnf(i_0_41, negated_conjecture, (c4_1(a146)|c5_1(X1)|c4_0|~c1_2(X1,a147))). % 0.22/0.40 cnf(i_0_44, negated_conjecture, (c5_1(X1)|c4_0|~c3_1(a146)|~c5_2(X1,a147))). % 0.22/0.40 cnf(i_0_54, negated_conjecture, (c2_0|~c1_2(a145,X1)|~c5_2(a145,X1)|~c2_2(a145,X1)|~ndr1_1(a145))). % 0.22/0.40 cnf(i_0_22, negated_conjecture, (c4_1(X1)|c5_1(X1)|c2_0|~c4_1(a152))). % 0.22/0.40 cnf(i_0_47, negated_conjecture, (c5_1(X1)|c4_0|ndr1_1(X1)|~c3_1(a146))). % 0.22/0.40 cnf(i_0_42, negated_conjecture, (c4_1(a146)|c5_1(X1)|c4_0|c3_2(X1,a147))). % 0.22/0.40 cnf(i_0_46, negated_conjecture, (c5_1(X1)|c4_0|c3_2(X1,a147)|~c3_1(a146))). % 0.22/0.40 cnf(i_0_76, negated_conjecture, (c3_2(X1,a142)|~c2_0|~c1_1(a143)|~c1_1(X1)|~c2_2(X1,a141))). % 0.22/0.40 cnf(i_0_70, negated_conjecture, (c3_2(X1,a142)|~c2_0|~c1_1(a143)|~c1_1(X1)|~c5_2(X1,a141))). % 0.22/0.40 cnf(i_0_64, negated_conjecture, (c3_2(X1,a142)|~c2_0|~c1_1(a143)|~c1_1(X1)|~c1_2(X1,a141))). % 0.22/0.40 cnf(i_0_5, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|ndr1_1(a155)|~c4_0)). % 0.22/0.40 cnf(i_0_33, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|ndr1_1(X1)|~c4_1(a150))). % 0.22/0.40 cnf(i_0_6, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|~c4_1(a155)|~c4_0)). % 0.22/0.40 cnf(i_0_30, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c5_2(X1,a149)|~c4_1(a150))). % 0.22/0.40 cnf(i_0_59, negated_conjecture, (c4_2(a144,X1)|c3_2(a144,X1)|~c4_0|~c5_2(a144,X1)|~ndr1_1(a144))). % 0.22/0.40 cnf(i_0_27, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c4_2(X1,a149)|~c4_1(a150))). % 0.22/0.40 cnf(i_0_2, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|c2_2(a155,a156)|~c4_0)). % 0.22/0.40 cnf(i_0_3, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|c5_2(a155,a156)|~c4_0)). % 0.22/0.40 cnf(i_0_4, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|c1_2(a155,a156)|~c4_0)). % 0.22/0.40 cnf(i_0_34, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c5_2(a150,X2)|ndr1_1(X1)|~c4_2(a150,X2)|~ndr1_1(a150))). % 0.22/0.40 cnf(i_0_56, negated_conjecture, (c4_2(X1,X2)|c1_2(X1,X2)|~c3_1(X1)|~c5_1(X1)|~c1_0|~ndr1_1(X1))). % 0.22/0.40 cnf(i_0_31, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c5_2(a150,X2)|c5_2(X1,a149)|~c4_2(a150,X2)|~ndr1_1(a150))). % 0.22/0.40 cnf(i_0_1, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|c5_2(a155,X2)|~c4_0|~c4_2(a155,X2)|~c2_2(a155,X2))). % 0.22/0.40 cnf(i_0_28, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c4_2(X1,a149)|c5_2(a150,X2)|~c4_2(a150,X2)|~ndr1_1(a150))). % 0.22/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.40 # Begin printing tableau % 0.22/0.40 # Found 3 steps % 0.22/0.40 cnf(i_0_4, negated_conjecture, (c4_1(a150)|c5_1(a150)|c1_1(a150)|c1_2(a155,a156)|~c4_0), inference(start_rule)). % 0.22/0.40 cnf(i_0_120, plain, (c4_1(a150)), inference(extension_rule, [i_0_27])). % 0.22/0.40 cnf(i_0_344, plain, (c3_0), inference(extension_rule, [i_0_25])). % 0.22/0.40 # End printing tableau % 0.22/0.40 # SZS output end % 0.22/0.40 # Branches closed with saturation will be marked with an "s" % 0.22/0.40 # There were 1 total branch saturation attempts. % 0.22/0.40 # There were 0 of these attempts blocked. % 0.22/0.40 # There were 0 deferred branch saturation attempts. % 0.22/0.40 # There were 0 free duplicated saturations. % 0.22/0.40 # There were 0 total successful branch saturations. % 0.22/0.40 # There were 0 successful branch saturations in interreduction. % 0.22/0.40 # There were 0 successful branch saturations on the branch. % 0.22/0.40 # There were 0 successful branch saturations after the branch. % 0.22/0.40 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.22/0.40 # Begin clausification derivation % 0.22/0.40 % 0.22/0.40 # End clausification derivation % 0.22/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.40 cnf(i_0_19, negated_conjecture, (ndr1_0)). % 0.22/0.40 cnf(i_0_57, negated_conjecture, (~c4_1(a144)|~c4_0)). % 0.22/0.40 cnf(i_0_24, negated_conjecture, (~c3_0|~c3_1(a151))). % 0.22/0.40 cnf(i_0_53, negated_conjecture, (c3_1(a145)|c2_0)). % 0.22/0.40 cnf(i_0_25, negated_conjecture, (~c3_0|~c2_1(a151))). % 0.22/0.40 cnf(i_0_52, negated_conjecture, (c2_0|~c5_1(a145))). % 0.22/0.40 cnf(i_0_37, negated_conjecture, (~c3_1(a148)|~c1_0|~c5_0)). % 0.22/0.40 cnf(i_0_58, negated_conjecture, (c5_1(a144)|~c4_0)). % 0.22/0.40 cnf(i_0_36, negated_conjecture, (~c2_1(a148)|~c1_0|~c5_0)). % 0.22/0.40 cnf(i_0_61, negated_conjecture, (c1_0|c5_0|c2_0)). % 0.22/0.40 cnf(i_0_38, negated_conjecture, (c5_1(a148)|~c1_0|~c5_0)). % 0.22/0.40 cnf(i_0_14, negated_conjecture, (c3_0|~c5_1(a154)|~c1_1(a153))). % 0.22/0.40 cnf(i_0_10, negated_conjecture, (c3_0|~c5_1(a153)|~c5_1(a154))). % 0.22/0.40 cnf(i_0_13, negated_conjecture, (c3_0|c1_1(a154)|~c1_1(a153))). % 0.22/0.40 cnf(i_0_9, negated_conjecture, (c3_0|c1_1(a154)|~c5_1(a153))). % 0.22/0.40 cnf(i_0_12, negated_conjecture, (c3_0|~c1_1(a153)|~c1_2(a154,X1)|~c5_2(a154,X1)|~ndr1_1(a154))). % 0.22/0.40 cnf(i_0_8, negated_conjecture, (c3_0|~c5_1(a153)|~c1_2(a154,X1)|~c5_2(a154,X1)|~ndr1_1(a154))). % 0.22/0.40 cnf(i_0_45, negated_conjecture, (c5_1(X1)|c4_0|~c3_1(a146)|~c1_2(X1,a147))). % 0.22/0.40 cnf(i_0_20, negated_conjecture, (c3_1(a152)|c4_1(X1)|c5_1(X1)|c2_0)). % 0.22/0.40 cnf(i_0_43, negated_conjecture, (c4_1(a146)|c5_1(X1)|c4_0|ndr1_1(X1))). % 0.22/0.40 cnf(i_0_84, negated_conjecture, (ndr1_1(X1)|~c2_0|~c1_1(a143)|~c1_1(X1))). % 0.22/0.40 cnf(i_0_74, negated_conjecture, (~c2_0|~c1_1(a143)|~c1_1(X1)|~c4_2(X1,a142)|~c2_2(X1,a141))). % 0.22/0.40 cnf(i_0_68, negated_conjecture, (~c2_0|~c1_1(a143)|~c1_1(X1)|~c4_2(X1,a142)|~c5_2(X1,a141))). % 0.22/0.40 cnf(i_0_62, negated_conjecture, (~c2_0|~c1_1(a143)|~c1_1(X1)|~c4_2(X1,a142)|~c1_2(X1,a141))). % 0.22/0.40 cnf(i_0_21, negated_conjecture, (c4_1(X1)|c5_1(X1)|c2_0|~c1_1(a152))). % 0.22/0.40 cnf(i_0_40, negated_conjecture, (c4_1(a146)|c5_1(X1)|c4_0|~c5_2(X1,a147))). % 0.22/0.40 cnf(i_0_41, negated_conjecture, (c4_1(a146)|c5_1(X1)|c4_0|~c1_2(X1,a147))). % 0.22/0.40 cnf(i_0_44, negated_conjecture, (c5_1(X1)|c4_0|~c3_1(a146)|~c5_2(X1,a147))). % 0.22/0.40 cnf(i_0_54, negated_conjecture, (c2_0|~c1_2(a145,X1)|~c5_2(a145,X1)|~c2_2(a145,X1)|~ndr1_1(a145))). % 0.22/0.40 cnf(i_0_22, negated_conjecture, (c4_1(X1)|c5_1(X1)|c2_0|~c4_1(a152))). % 0.22/0.40 cnf(i_0_47, negated_conjecture, (c5_1(X1)|c4_0|ndr1_1(X1)|~c3_1(a146))). % 0.22/0.40 cnf(i_0_42, negated_conjecture, (c4_1(a146)|c5_1(X1)|c4_0|c3_2(X1,a147))). % 0.22/0.40 cnf(i_0_46, negated_conjecture, (c5_1(X1)|c4_0|c3_2(X1,a147)|~c3_1(a146))). % 0.22/0.40 cnf(i_0_76, negated_conjecture, (c3_2(X1,a142)|~c2_0|~c1_1(a143)|~c1_1(X1)|~c2_2(X1,a141))). % 0.22/0.40 cnf(i_0_70, negated_conjecture, (c3_2(X1,a142)|~c2_0|~c1_1(a143)|~c1_1(X1)|~c5_2(X1,a141))). % 0.22/0.40 cnf(i_0_64, negated_conjecture, (c3_2(X1,a142)|~c2_0|~c1_1(a143)|~c1_1(X1)|~c1_2(X1,a141))). % 0.22/0.40 cnf(i_0_5, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|ndr1_1(a155)|~c4_0)). % 0.22/0.40 cnf(i_0_33, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|ndr1_1(X1)|~c4_1(a150))). % 0.22/0.40 cnf(i_0_6, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|~c4_1(a155)|~c4_0)). % 0.22/0.40 cnf(i_0_30, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c5_2(X1,a149)|~c4_1(a150))). % 0.22/0.40 cnf(i_0_59, negated_conjecture, (c4_2(a144,X1)|c3_2(a144,X1)|~c4_0|~c5_2(a144,X1)|~ndr1_1(a144))). % 0.22/0.40 cnf(i_0_27, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c4_2(X1,a149)|~c4_1(a150))). % 0.22/0.40 cnf(i_0_2, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|c2_2(a155,a156)|~c4_0)). % 0.22/0.40 cnf(i_0_3, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|c5_2(a155,a156)|~c4_0)). % 0.22/0.40 cnf(i_0_4, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|c1_2(a155,a156)|~c4_0)). % 0.22/0.40 cnf(i_0_34, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c5_2(a150,X2)|ndr1_1(X1)|~c4_2(a150,X2)|~ndr1_1(a150))). % 0.22/0.40 cnf(i_0_56, negated_conjecture, (c4_2(X1,X2)|c1_2(X1,X2)|~c3_1(X1)|~c5_1(X1)|~c1_0|~ndr1_1(X1))). % 0.22/0.40 cnf(i_0_31, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c5_2(a150,X2)|c5_2(X1,a149)|~c4_2(a150,X2)|~ndr1_1(a150))). % 0.22/0.40 cnf(i_0_1, negated_conjecture, (c4_1(X1)|c5_1(X1)|c1_1(X1)|c5_2(a155,X2)|~c4_0|~c4_2(a155,X2)|~c2_2(a155,X2))). % 0.22/0.40 cnf(i_0_28, negated_conjecture, (c3_0|c3_1(X1)|c4_1(X1)|c4_2(X1,a149)|c5_2(a150,X2)|~c4_2(a150,X2)|~ndr1_1(a150))). % 0.22/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.40 # Begin printing tableau % 0.22/0.40 # Found 3 steps % 0.22/0.40 cnf(i_0_2, negated_conjecture, (c4_1(a150)|c5_1(a150)|c1_1(a150)|c2_2(a155,a156)|~c4_0), inference(start_rule)). % 0.22/0.40 cnf(i_0_130, plain, (c4_1(a150)), inference(extension_rule, [i_0_27])). % 0.22/0.40 cnf(i_0_344, plain, (c3_0), inference(extension_rule, [i_0_25])). % 0.22/0.40 # End printing tableau % 0.22/0.40 # SZS output end % 0.22/0.40 # Branches closed with saturation will be marked with an "s" % 0.22/0.40 # Child (32211) has found a proof. % 0.22/0.40 % 0.22/0.40 # Proof search is over... % 0.22/0.40 # Freeing feature tree %------------------------------------------------------------------------------