%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG007-1 : TPTP v8.1.0. Released v2.2.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 : n022.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 14 16:51:08 EDT 2022 % Result : Unsatisfiable 33.70s 33.89s % Output : CNFRefutation 33.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : ALG007-1 : TPTP v8.1.0. Released v2.2.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n022.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Wed Jun 8 12:54:50 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 4 Number of unprocessed: 4 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 9.14/9.31 # The folding up rule is enabled... % 9.14/9.31 # Local unification is enabled... % 9.14/9.31 # Any saturation attempts will use folding labels... % 9.14/9.31 # 4 beginning clauses after preprocessing and clausification % 9.14/9.31 # Creating start rules for all 1 conjectures. % 9.14/9.31 # There are 1 start rule candidates: % 9.14/9.31 # Found 4 unit axioms. % 9.14/9.31 # 1 start rule tableaux created. % 9.14/9.31 # 0 extension rule candidate clauses % 9.14/9.31 # 4 unit axiom clauses % 9.14/9.31 % 9.14/9.31 # Requested 8, 32 cores available to the main process. % 9.14/9.31 # There are not enough tableaux to fork, creating more from the initial 1 % 9.14/9.31 # Creating equality axioms % 9.14/9.31 # Ran out of tableaux, making start rules for all clauses % 33.70/33.89 # There were 4 total branch saturation attempts. % 33.70/33.89 # There were 0 of these attempts blocked. % 33.70/33.89 # There were 0 deferred branch saturation attempts. % 33.70/33.89 # There were 0 free duplicated saturations. % 33.70/33.89 # There were 1 total successful branch saturations. % 33.70/33.89 # There were 0 successful branch saturations in interreduction. % 33.70/33.89 # There were 0 successful branch saturations on the branch. % 33.70/33.89 # There were 1 successful branch saturations after the branch. % 33.70/33.89 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 33.70/33.89 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 33.70/33.89 # Begin clausification derivation % 33.70/33.89 % 33.70/33.89 # End clausification derivation % 33.70/33.89 # Begin listing active clauses obtained from FOF to CNF conversion % 33.70/33.89 cnf(i_0_5, plain, (difference(X1,difference(X2,X1))=X1)). % 33.70/33.89 cnf(i_0_6, plain, (difference(X1,difference(X1,X2))=difference(X2,difference(X2,X1)))). % 33.70/33.89 cnf(i_0_7, plain, (difference(difference(X1,X2),X3)=difference(difference(X1,X3),X2))). % 33.70/33.89 cnf(i_0_8, negated_conjecture, (difference(difference(a,c),difference(b,c))!=difference(difference(a,c),b))). % 33.70/33.89 cnf(i_0_10, plain, (X4=X4)). % 33.70/33.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 33.70/33.89 # Begin printing tableau % 33.70/33.89 # Found 6 steps % 33.70/33.89 cnf(i_0_5, plain, (difference(X14,difference(X12,X14))=X14), inference(start_rule)). % 33.70/33.89 cnf(i_0_15, plain, (difference(X14,difference(X12,X14))=X14), inference(extension_rule, [i_0_14])). % 33.70/33.89 cnf(i_0_28, plain, (difference(X15,difference(X16,X15))!=X15), inference(closure_rule, [i_0_5])). % 33.70/33.89 cnf(i_0_27, plain, (difference(difference(X15,difference(X16,X15)),difference(X14,difference(X12,X14)))=difference(X15,X14)), inference(extension_rule, [i_0_14])). % 33.70/33.89 cnf(i_0_1698690, plain, (difference(X11,difference(X2,X11))!=X11), inference(closure_rule, [i_0_5])). % 33.70/33.89 cnf(i_0_1698688, plain, (difference(difference(difference(X15,difference(X16,X15)),difference(X14,difference(X12,X14))),difference(X11,difference(X2,X11)))=difference(difference(X15,X14),X11)), inference(etableau_closure_rule, [i_0_1698688, ...])). % 33.70/33.89 # End printing tableau % 33.70/33.89 # SZS output end % 33.70/33.89 # Branches closed with saturation will be marked with an "s" % 33.70/33.89 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 33.70/33.89 # We now have 10 tableaux to operate on % 33.70/33.89 # Found closed tableau during pool population. % 33.70/33.89 # Proof search is over... % 33.70/33.89 # Freeing feature tree %------------------------------------------------------------------------------