%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN492-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 : n005.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:41 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.11/0.11 % Problem : SYN492-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 : n005.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 12 07:03:51 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: 60 Number of unprocessed: 60 % 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 # 60 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 60 conjectures. % 0.12/0.36 # There are 60 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 # 60 start rule tableaux created. % 0.12/0.36 # 60 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 # 1362 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 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_61, negated_conjecture, (ndr1_0|~hskp12)). % 0.12/0.37 cnf(i_0_62, negated_conjecture, (ndr1_0|~hskp11)). % 0.12/0.37 cnf(i_0_63, negated_conjecture, (ndr1_0|~hskp10)). % 0.12/0.37 cnf(i_0_64, negated_conjecture, (ndr1_0|~hskp9)). % 0.12/0.37 cnf(i_0_65, negated_conjecture, (ndr1_0|~hskp8)). % 0.12/0.37 cnf(i_0_66, negated_conjecture, (ndr1_0|~hskp7)). % 0.12/0.37 cnf(i_0_67, negated_conjecture, (ndr1_0|~hskp6)). % 0.12/0.37 cnf(i_0_68, negated_conjecture, (ndr1_0|~hskp5)). % 0.12/0.37 cnf(i_0_69, negated_conjecture, (ndr1_0|~hskp4)). % 0.12/0.37 cnf(i_0_70, negated_conjecture, (ndr1_0|~hskp3)). % 0.12/0.37 cnf(i_0_71, negated_conjecture, (ndr1_0|~hskp2)). % 0.12/0.37 cnf(i_0_72, negated_conjecture, (ndr1_0|~hskp1)). % 0.12/0.37 cnf(i_0_73, negated_conjecture, (ndr1_0|~hskp0)). % 0.12/0.37 cnf(i_0_92, negated_conjecture, (~c0_1(a32)|~hskp12)). % 0.12/0.37 cnf(i_0_93, negated_conjecture, (~c3_1(a26)|~hskp10)). % 0.12/0.37 cnf(i_0_94, negated_conjecture, (~c3_1(a25)|~hskp9)). % 0.12/0.37 cnf(i_0_74, negated_conjecture, (hskp3|hskp11|hskp12)). % 0.12/0.37 cnf(i_0_75, negated_conjecture, (c1_1(a32)|~hskp12)). % 0.12/0.37 cnf(i_0_95, negated_conjecture, (~c1_1(a37)|~hskp8)). % 0.12/0.37 cnf(i_0_96, negated_conjecture, (~c3_1(a36)|~hskp7)). % 0.12/0.37 cnf(i_0_98, negated_conjecture, (~c0_1(a36)|~hskp7)). % 0.12/0.37 cnf(i_0_97, negated_conjecture, (~c2_1(a36)|~hskp7)). % 0.12/0.37 cnf(i_0_80, negated_conjecture, (c1_1(a26)|~hskp10)). % 0.12/0.37 cnf(i_0_99, negated_conjecture, (~c3_1(a35)|~hskp6)). % 0.12/0.37 cnf(i_0_100, negated_conjecture, (~c0_1(a35)|~hskp6)). % 0.12/0.37 cnf(i_0_101, negated_conjecture, (~c2_1(a35)|~hskp6)). % 0.12/0.37 cnf(i_0_102, negated_conjecture, (~c3_1(a34)|~hskp5)). % 0.12/0.37 cnf(i_0_82, negated_conjecture, (c1_1(a25)|~hskp9)). % 0.12/0.37 cnf(i_0_87, negated_conjecture, (c1_1(a33)|~hskp4)). % 0.12/0.37 cnf(i_0_103, negated_conjecture, (~c2_1(a34)|~hskp5)). % 0.12/0.37 cnf(i_0_105, negated_conjecture, (~c0_1(a33)|~hskp4)). % 0.12/0.37 cnf(i_0_104, negated_conjecture, (~c2_1(a33)|~hskp4)). % 0.12/0.37 cnf(i_0_106, negated_conjecture, (~c1_1(a31)|~hskp3)). % 0.12/0.37 cnf(i_0_89, negated_conjecture, (c1_1(a29)|~hskp2)). % 0.12/0.37 cnf(i_0_107, negated_conjecture, (~c3_1(a31)|~hskp3)). % 0.12/0.37 cnf(i_0_108, negated_conjecture, (~c3_1(a29)|~hskp2)). % 0.12/0.37 cnf(i_0_109, negated_conjecture, (~c2_1(a29)|~hskp2)). % 0.12/0.37 cnf(i_0_111, negated_conjecture, (~c0_1(a28)|~hskp1)). % 0.12/0.37 cnf(i_0_90, negated_conjecture, (c1_1(a28)|~hskp1)). % 0.12/0.37 cnf(i_0_76, negated_conjecture, (c3_1(a32)|~hskp12)). % 0.12/0.37 cnf(i_0_110, negated_conjecture, (~c2_1(a28)|~hskp1)). % 0.12/0.37 cnf(i_0_112, negated_conjecture, (~c0_1(a27)|~hskp0)). % 0.12/0.37 cnf(i_0_113, negated_conjecture, (~c2_1(a27)|~hskp0)). % 0.12/0.37 cnf(i_0_77, negated_conjecture, (c3_1(a30)|~hskp11)). % 0.12/0.37 cnf(i_0_85, negated_conjecture, (c3_1(a37)|~hskp8)). % 0.12/0.37 cnf(i_0_91, negated_conjecture, (c3_1(a27)|~hskp0)). % 0.12/0.37 cnf(i_0_78, negated_conjecture, (c0_1(a30)|~hskp11)). % 0.12/0.37 cnf(i_0_81, negated_conjecture, (c0_1(a26)|~hskp10)). % 0.12/0.37 cnf(i_0_83, negated_conjecture, (c0_1(a25)|~hskp9)). % 0.12/0.37 cnf(i_0_86, negated_conjecture, (c0_1(a34)|~hskp5)). % 0.12/0.37 cnf(i_0_79, negated_conjecture, (c2_1(a30)|~hskp11)). % 0.12/0.37 cnf(i_0_84, negated_conjecture, (c2_1(a37)|~hskp8)). % 0.12/0.37 cnf(i_0_88, negated_conjecture, (c2_1(a31)|~hskp3)). % 0.12/0.37 cnf(i_0_116, negated_conjecture, (c3_1(X1)|hskp9|hskp10|~c0_1(X1)|~c1_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_115, negated_conjecture, (c2_1(X1)|c0_1(X1)|hskp7|hskp8|~c1_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_114, negated_conjecture, (c2_1(X1)|c1_1(X1)|hskp0|hskp1|~c3_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_120, negated_conjecture, (c0_1(X1)|c1_1(X1)|hskp6|~c2_1(X2)|~c0_1(X2)|~c3_1(X2)|~c3_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_119, negated_conjecture, (c0_1(X1)|c0_1(X2)|c1_1(X2)|hskp4|~c2_1(X2)|~c3_1(X1)|~c1_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_118, negated_conjecture, (c0_1(X1)|c3_1(X1)|c1_1(X2)|c1_1(X1)|hskp5|~c2_1(X2)|~c0_1(X2)|~ndr1_0)). % 0.12/0.37 cnf(i_0_117, negated_conjecture, (c2_1(X1)|c0_1(X2)|c0_1(X1)|c3_1(X1)|hskp2|~c2_1(X2)|~c1_1(X2)|~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_116, negated_conjecture, (c3_1(a29)|hskp9|hskp10|~c0_1(a29)|~c1_1(a29)|~ndr1_0), inference(start_rule)). % 0.12/0.37 cnf(i_0_165, plain, (c3_1(a29)), inference(e# 1361 Satisfiable branch % 0.12/0.37 xtension_rule, [i_0_108])). % 0.12/0.37 cnf(i_0_363, plain, (~hskp2), inference(extension_rule, [i_0_117])). % 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 # 1360 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_61, negated_conjecture, (ndr1_0|~hskp12)). % 0.12/0.37 cnf(i_0_62, negated_conjecture, (ndr1_0|~hskp11)). % 0.12/0.37 cnf(i_0_63, negated_conjecture, (ndr1_0|~hskp10)). % 0.12/0.37 cnf(i_0_64, negated_conjecture, (ndr1_0|~hskp9)). % 0.12/0.37 cnf(i_0_65, negated_conjecture, (ndr1_0|~hskp8)). % 0.12/0.37 cnf(i_0_66, negated_conjecture, (ndr1_0|~hskp7)). % 0.12/0.37 cnf(i_0_67, negated_conjecture, (ndr1_0|~hskp6)). % 0.12/0.37 cnf(i_0_68, negated_conjecture, (ndr1_0|~hskp5)). % 0.12/0.37 cnf(i_0_69, negated_conjecture, (ndr1_0|~hskp4)). % 0.12/0.37 cnf(i_0_70, negated_conjecture, (ndr1_0|~hskp3)). % 0.12/0.37 cnf(i_0_71, negated_conjecture, (ndr1_0|~hskp2)). % 0.12/0.37 cnf(i_0_72, negated_conjecture, (ndr1_0|~hskp1)). % 0.12/0.37 cnf(i_0_73, negated_conjecture, (ndr1_0|~hskp0)). % 0.12/0.37 cnf(i_0_92, negated_conjecture, (~c0_1(a32)|~hskp12)). % 0.12/0.37 cnf(i_0_93, negated_conjecture, (~c3_1(a26)|~hskp10)). % 0.12/0.37 cnf(i_0_94, negated_conjecture, (~c3_1(a25)|~hskp9)). % 0.12/0.37 cnf(i_0_74, negated_conjecture, (hskp3|hskp11|hskp12)). % 0.12/0.37 cnf(i_0_75, negated_conjecture, (c1_1(a32)|~hskp12)). % 0.12/0.37 cnf(i_0_95, negated_conjecture, (~c1_1(a37)|~hskp8)). % 0.12/0.37 cnf(i_0_96, negated_conjecture, (~c3_1(a36)|~hskp7)). % 0.12/0.37 cnf(i_0_98, negated_conjecture, (~c0_1(a36)|~hskp7)). % 0.12/0.37 cnf(i_0_97, negated_conjecture, (~c2_1(a36)|~hskp7)). % 0.12/0.37 cnf(i_0_80, negated_conjecture, (c1_1(a26)|~hskp10)). % 0.12/0.37 cnf(i_0_99, negated_conjecture, (~c3_1(a35)|~hskp6)). % 0.12/0.37 cnf(i_0_100, negated_conjecture, (~c0_1(a35)|~hskp6)). % 0.12/0.37 cnf(i_0_101, negated_conjecture, (~c2_1(a35)|~hskp6)). % 0.12/0.37 cnf(i_0_102, negated_conjecture, (~c3_1(a34)|~hskp5)). % 0.12/0.37 cnf(i_0_82, negated_conjecture, (c1_1(a25)|~hskp9)). % 0.12/0.37 cnf(i_0_87, negated_conjecture, (c1_1(a33)|~hskp4)). % 0.12/0.37 cnf(i_0_103, negated_conjecture, (~c2_1(a34)|~hskp5)). % 0.12/0.37 cnf(i_0_105, negated_conjecture, (~c0_1(a33)|~hskp4)). % 0.12/0.37 cnf(i_0_104, negated_conjecture, (~c2_1(a33)|~hskp4)). % 0.12/0.37 cnf(i_0_106, negated_conjecture, (~c1_1(a31)|~hskp3)). % 0.12/0.37 cnf(i_0_89, negated_conjecture, (c1_1(a29)|~hskp2)). % 0.12/0.37 cnf(i_0_107, negated_conjecture, (~c3_1(a31)|~hskp3)). % 0.12/0.37 cnf(i_0_108, negated_conjecture, (~c3_1(a29)|~hskp2)). % 0.12/0.37 cnf(i_0_109, negated_conjecture, (~c2_1(a29)|~hskp2)). % 0.12/0.37 cnf(i_0_111, negated_conjecture, (~c0_1(a28)|~hskp1)). % 0.12/0.37 cnf(i_0_90, negated_conjecture, (c1_1(a28)|~hskp1)). % 0.12/0.37 cnf(i_0_76, negated_conjecture, (c3_1(a32)|~hskp12)). % 0.12/0.37 cnf(i_0_110, negated_conjecture, (~c2_1(a28)|~hskp1)). % 0.12/0.37 cnf(i_0_112, negated_conjecture, (~c0_1(a27)|~hskp0)). % 0.12/0.37 cnf(i_0_113, negated_conjecture, (~c2_1(a27)|~hskp0)). % 0.12/0.37 cnf(i_0_77, negated_conjecture, (c3_1(a30)|~hskp11)). % 0.12/0.37 cnf(i_0_85, negated_conjecture, (c3_1(a37)|~hskp8)). % 0.12/0.37 cnf(i_0_91, negated_conjecture, (c3_1(a27)|~hskp0)). % 0.12/0.37 cnf(i_0_78, negated_conjecture, (c0_1(a30)|~hskp11)). % 0.12/0.37 cnf(i_0_81, negated_conjecture, (c0_1(a26)|~hskp10)). % 0.12/0.37 cnf(i_0_83, negated_conjecture, (c0_1(a25)|~hskp9)). % 0.12/0.37 cnf(i_0_86, negated_conjecture, (c0_1(a34)|~hskp5)). % 0.12/0.37 cnf(i_0_79, negated_conjecture, (c2_1(a30)|~hskp11)). % 0.12/0.37 cnf(i_0_84, negated_conjecture, (c2_1(a37)|~hskp8)). % 0.12/0.37 cnf(i_0_88, negated_conjecture, (c2_1(a31)|~hskp3)). % 0.12/0.37 cnf(i_0_116, negated_conjecture, (c3_1(X1)|hskp9|hskp10|~c0_1(X1)|~c1_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_115, negated_conjecture, (c2_1(X1)|c0_1(X1)|hskp7|hskp8|~c1_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_114, negated_conjecture, (c2_1(X1)|c1_1(X1)|hskp0|hskp1|~c3_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_120, negated_conjecture, (c0_1(X1)|c1_1(X1)|hskp6|~c2_1(X2)|~c0_1(X2)|~c3_1(X2)|~c3_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_119, negated_conjecture, (c0_1(X1)|c0_1(X2)|c1_1(X2)|hskp4|~c2_1(X2)|~c3_1(X1)|~c1_1(X1)|~ndr1_0)). % 0.12/0.37 cnf(i_0_118, negated_conjecture, (c0_1(X1)|c3_1(X1)|c1_1(X2)|c1_1(X1)|hskp5|~c2_1(X2)|~c0_1(X2)|~ndr1_0)). % 0.12/0.37 cnf(i_0_117, negated_conjecture, (c2_1(X1)|c0_1(X2)|c0_1(X1)|c3_1(X1)|hskp2|~c2_1(X2)|~c1_1(X2)|~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_115, negated_conjecture, (c2_1(a27)|c0_1(a27)|hskp7|hskp8|~c1_1(a27)|~ndr1_0), inference(start_rule)). % 0.12/0.37 cnf(i_0_159, plain, (c2_1(a27)), inference(ext# Child (1362) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------