%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN495+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 : n006.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:44 EDT 2022 % Result : CounterSatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN495+1 : TPTP v8.1.0. Released v2.1.0. % 0.11/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 : n006.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 23:40:50 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___207_C18_F1_AE_CS_SP_PI_PS_S0S % 0.12/0.36 # and selection function SelectComplexG. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 76 Number of unprocessed: 76 % 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 # 76 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 76 conjectures. % 0.12/0.36 # There are 76 start rule candidates: % 0.12/0.36 # Found 0 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 76 start rule tableaux created. % 0.12/0.36 # 76 extension rule candidate clauses % 0.12/0.36 # 0 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # 20232 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 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_76, negated_conjecture, (ndr1_0|~hskp0)). % 0.12/0.37 cnf(i_0_72, negated_conjecture, (ndr1_0|~hskp1)). % 0.12/0.37 cnf(i_0_68, negated_conjecture, (ndr1_0|~hskp2)). % 0.12/0.37 cnf(i_0_64, negated_conjecture, (ndr1_0|~hskp3)). % 0.12/0.37 cnf(i_0_60, negated_conjecture, (ndr1_0|~hskp4)). % 0.12/0.37 cnf(i_0_56, negated_conjecture, (ndr1_0|~hskp5)). % 0.12/0.37 cnf(i_0_52, negated_conjecture, (ndr1_0|~hskp6)). % 0.12/0.37 cnf(i_0_48, negated_conjecture, (ndr1_0|~hskp7)). % 0.12/0.37 cnf(i_0_44, negated_conjecture, (ndr1_0|~hskp8)). % 0.12/0.37 cnf(i_0_40, negated_conjecture, (ndr1_0|~hskp9)). % 0.12/0.37 cnf(i_0_36, negated_conjecture, (ndr1_0|~hskp10)). % 0.12/0.37 cnf(i_0_32, negated_conjecture, (ndr1_0|~hskp11)). % 0.12/0.37 cnf(i_0_28, negated_conjecture, (ndr1_0|~hskp12)). % 0.12/0.37 cnf(i_0_24, negated_conjecture, (ndr1_0|~hskp13)). % 0.12/0.37 cnf(i_0_20, negated_conjecture, (ndr1_0|~hskp14)). % 0.12/0.37 cnf(i_0_16, negated_conjecture, (ndr1_0|~hskp15)). % 0.12/0.37 cnf(i_0_12, negated_conjecture, (ndr1_0|~hskp16)). % 0.12/0.37 cnf(i_0_75, negated_conjecture, (c3_1(a61)|~hskp0)). % 0.12/0.37 cnf(i_0_73, negated_conjecture, (~c2_1(a61)|~hskp0)). % 0.12/0.37 cnf(i_0_69, negated_conjecture, (~hskp1|~c3_1(a66))). % 0.12/0.37 cnf(i_0_65, negated_conjecture, (~hskp2|~c2_1(a69))). % 0.12/0.37 cnf(i_0_67, negated_conjecture, (~hskp2|~c0_1(a69))). % 0.12/0.37 cnf(i_0_66, negated_conjecture, (c3_1(a69)|~hskp2)). % 0.12/0.37 cnf(i_0_61, negated_conjecture, (~hskp3|~c1_1(a71))). % 0.12/0.37 cnf(i_0_57, negated_conjecture, (~hskp4|~c2_1(a73))). % 0.12/0.37 cnf(i_0_53, negated_conjecture, (~hskp5|~c1_1(a75))). % 0.12/0.37 cnf(i_0_55, negated_conjecture, (~hskp5|~c0_1(a75))). % 0.12/0.37 cnf(i_0_6, negated_conjecture, (hskp12|hskp11|hskp1)). % 0.12/0.37 cnf(i_0_62, negated_conjecture, (c3_1(a71)|~hskp3)). % 0.12/0.37 cnf(i_0_49, negated_conjecture, (~hskp6|~c2_1(a76))). % 0.12/0.37 cnf(i_0_47, negated_conjecture, (~hskp7|~c2_1(a77))). % 0.12/0.37 cnf(i_0_45, negated_conjecture, (~hskp7|~c0_1(a77))). % 0.12/0.37 cnf(i_0_43, negated_conjecture, (~hskp8|~c1_1(a62))). % 0.12/0.37 cnf(i_0_46, negated_conjecture, (c3_1(a77)|~hskp7)). % 0.12/0.37 cnf(i_0_38, negated_conjecture, (~hskp9|~c1_1(a63))). % 0.12/0.37 cnf(i_0_35, negated_conjecture, (~hskp10|~c3_1(a64))). % 0.12/0.37 cnf(i_0_34, negated_conjecture, (~hskp10|~c2_1(a64))). % 0.12/0.37 cnf(i_0_31, negated_conjecture, (~hskp11|~c1_1(a65))). % 0.12/0.37 cnf(i_0_5, negated_conjecture, (hskp14|hskp13|hskp2)). % 0.12/0.37 cnf(i_0_42, negated_conjecture, (c3_1(a62)|~hskp8)). % 0.12/0.37 cnf(i_0_30, negated_conjecture, (~hskp11|~c0_1(a65))). % 0.12/0.37 cnf(i_0_27, negated_conjecture, (~hskp12|~c3_1(a67))). % 0.12/0.37 cnf(i_0_26, negated_conjecture, (~hskp12|~c2_1(a67))). % 0.12/0.37 cnf(i_0_23, negated_conjecture, (~hskp13|~c1_1(a68))). % 0.12/0.37 cnf(i_0_37, negated_conjecture, (c3_1(a63)|~hskp9)). % 0.12/0.37 cnf(i_0_19, negated_conjecture, (~hskp14|~c0_1(a70))). % 0.12/0.37 cnf(i_0_11, negated_conjecture, (~hskp16|~c1_1(a74))). % 0.12/0.37 cnf(i_0_18, negated_conjecture, (c3_1(a70)|~hskp14)). % 0.12/0.37 cnf(i_0_14, negated_conjecture, (c3_1(a72)|~hskp15)). % 0.12/0.37 cnf(i_0_2, negated_conjecture, (hskp16|hskp6|hskp5)). % 0.12/0.37 cnf(i_0_9, negated_conjecture, (c3_1(a74)|~hskp16)). % 0.12/0.37 cnf(i_0_74, negated_conjecture, (c1_1(a61)|~hskp0)). % 0.12/0.37 cnf(i_0_70, negated_conjecture, (c1_1(a66)|~hskp1)). % 0.12/0.37 cnf(i_0_59, negated_conjecture, (c1_1(a73)|~hskp4)). % 0.12/0.37 cnf(i_0_50, negated_conjecture, (c1_1(a76)|~hskp6)). % 0.12/0.37 cnf(i_0_25, negated_conjecture, (c1_1(a67)|~hskp12)). % 0.12/0.37 cnf(i_0_17, negated_conjecture, (c1_1(a70)|~hskp14)). % 0.12/0.37 cnf(i_0_15, negated_conjecture, (c1_1(a72)|~hskp15)). % 0.12/0.37 cnf(i_0_54, negated_conjecture, (c2_1(a75)|~hskp5)). % 0.12/0.37 cnf(i_0_39, negated_conjecture, (c2_1(a63)|~hskp9)). % 0.12/0.37 cnf(i_0_29, negated_conjecture, (c2_1(a65)|~hskp11)). % 0.12/0.37 cnf(i_0_22, negated_conjecture, (c2_1(a68)|~hskp13)). % 0.12/0.37 cnf(i_0_10, negated_conjecture, (c2_1(a74)|~hskp16)). % 0.12/0.37 cnf(i_0_71, negated_conjecture, (c0_1(a66)|~hskp1)). % 0.12/0.37 cnf(i_0_63, negated_conjecture, (c0_1(a71)|~hskp3)). % 0.12/0.37 cnf(i_0_58, negated_conjecture, (c0_1(a73)|~hskp4)). % 0.12/0.37 cnf(i_0_51, negated_conjecture, (c0_1(a76)|~hskp6)). % 0.12/0.37 cnf(i_0_41, negated_conjecture, (c0_1(a62)|~hskp8)). % 0.12/0.37 cnf(i_0_33, negated_conjecture, (c0_1(a64)|~hskp10)). % 0.12/0.37 cnf(i_0_21, negated_conjecture, (c0_1(a68)|~hskp13)). % 0.12/0.37 cnf(i_0_13, negated_conjecture, (c0_1(a72)|~hskp15)). % 0.12/0.37 cnf(i_0_8, negated_conjecture, (hskp8|c2_1(X1)|c1_1(X1)|c3_1(X1)|hskp0|~ndr1_0)). % 0.12/0.37 cnf(i_0_1, negated_conjecture, (hskp12|hskp7|c0_1(X1)|c1_1(X1)|~c3_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_4, negated_conjecture, (hskp15|hskp3|c0_1(X1)|~c1_1(X1)|~c3_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_7, negated_conjecture, (hskp10|hskp9|c3_1(X1)|~c0_1(X1)|~c1_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_3, negated_conjecture, (hskp4|c0_1(X1)|c1_1(X1)|c1_1(X2)|~c0_1(X2)|~c2_1(X2)|~c3_1(X1)|~ndr1_0)). % 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_13, negated_conjecture, (c0_1(a72)|~hskp15), inference(start_rule)). % 0.12/0.37 cnf(i_0_109, plain, (c0_1(a72)), inference(extension_rule, [i_0_3])). % 0.12/0.37 cnf(i_0_254, plain, (hskp4), inference(extension_rule, [i_0_58])). % 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 (20232) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------