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