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