%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG008-5 : TPTP v8.1.0. Released v1.0.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 : n029.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 : Mon Jul 18 20:27:03 EDT 2022 % Result : Unsatisfiable 0.46s 0.69s % Output : CNFRefutation 0.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : RNG008-5 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.13 % 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 : n029.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 May 30 17:55:59 EDT 2022 % 0.12/0.34 % 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_S4d % 0.12/0.36 # and selection function SelectCQIPrecWNTNp. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 26 Number of unprocessed: 25 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.19/0.53 # The folding up rule is enabled... % 0.19/0.53 # Local unification is enabled... % 0.19/0.53 # Any saturation attempts will use folding labels... % 0.19/0.53 # 25 beginning clauses after preprocessing and clausification % 0.19/0.53 # Creating start rules for all 1 conjectures. % 0.19/0.53 # There are 1 start rule candidates: % 0.19/0.53 # Found 14 unit axioms. % 0.19/0.53 # 1 start rule tableaux created. % 0.19/0.53 # 11 extension rule candidate clauses % 0.19/0.53 # 14 unit axiom clauses % 0.19/0.53 % 0.19/0.53 # Requested 8, 32 cores available to the main process. % 0.19/0.53 # There are not enough tableaux to fork, creating more from the initial 1 % 0.46/0.69 # There were 2 total branch saturation attempts. % 0.46/0.69 # There were 0 of these attempts blocked. % 0.46/0.69 # There were 0 deferred branch saturation attempts. % 0.46/0.69 # There were 0 free duplicated saturations. % 0.46/0.69 # There were 2 total successful branch saturations. % 0.46/0.69 # There were 0 successful branch saturations in interreduction. % 0.46/0.69 # There were 0 successful branch saturations on the branch. % 0.46/0.69 # There were 2 successful branch saturations after the branch. % 0.46/0.69 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.46/0.69 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.46/0.69 # Begin clausification derivation % 0.46/0.69 % 0.46/0.69 # End clausification derivation % 0.46/0.69 # Begin listing active clauses obtained from FOF to CNF conversion % 0.46/0.69 cnf(i_0_51, hypothesis, (product(a,b,c))). % 0.46/0.69 cnf(i_0_46, plain, (product(X1,additive_identity,additive_identity))). % 0.46/0.69 cnf(i_0_47, plain, (product(additive_identity,X1,additive_identity))). % 0.46/0.69 cnf(i_0_50, hypothesis, (product(X1,X1,X1))). % 0.46/0.69 cnf(i_0_28, plain, (sum(X1,additive_identity,X1))). % 0.46/0.69 cnf(i_0_27, plain, (sum(additive_identity,X1,X1))). % 0.46/0.69 cnf(i_0_32, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 0.46/0.69 cnf(i_0_31, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 0.46/0.69 cnf(i_0_30, plain, (sum(X1,X2,add(X1,X2)))). % 0.46/0.69 cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2)))). % 0.46/0.69 cnf(i_0_45, plain, (sum(additive_inverse(additive_inverse(X1)),additive_identity,X1))). % 0.46/0.69 cnf(i_0_49, plain, (product(X1,additive_inverse(X2),additive_inverse(multiply(X1,X2))))). % 0.46/0.69 cnf(i_0_48, plain, (sum(additive_inverse(X1),additive_inverse(X2),additive_inverse(add(X1,X2))))). % 0.46/0.69 cnf(i_0_52, negated_conjecture, (~product(b,a,c))). % 0.46/0.69 cnf(i_0_35, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 0.46/0.69 cnf(i_0_43, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.46/0.69 cnf(i_0_42, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 0.46/0.69 cnf(i_0_34, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 0.46/0.69 cnf(i_0_33, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 0.46/0.69 cnf(i_0_37, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.46/0.69 cnf(i_0_36, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.46/0.69 cnf(i_0_38, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 0.46/0.69 cnf(i_0_41, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 0.46/0.69 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 0.46/0.69 cnf(i_0_40, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 0.46/0.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.46/0.69 # Begin printing tableau % 0.46/0.69 # Found 9 steps % 0.46/0.69 cnf(i_0_52, negated_conjecture, (~product(b,a,c)), inference(start_rule)). % 0.46/0.69 cnf(i_0_53, plain, (~product(b,a,c)), inference(extension_rule, [i_0_39])). % 0.46/0.69 cnf(i_0_89, plain, (~product(b,additive_identity,additive_identity)), inference(closure_rule, [i_0_46])). % 0.46/0.69 cnf(i_0_90, plain, (~product(b,additive_identity,additive_identity)), inference(closure_rule, [i_0_46])). % 0.46/0.69 cnf(i_0_91, plain, (~sum(additive_identity,additive_identity,c)), inference(extension_rule, [i_0_34])). % 0.46/0.69 cnf(i_0_107, plain, (~sum(additive_identity,additive_identity,additive_identity)), inference(closure_rule, [i_0_28])). % 0.46/0.69 cnf(i_0_108, plain, (~sum(c,additive_identity,c)), inference(closure_rule, [i_0_28])). % 0.46/0.69 cnf(i_0_92, plain, (~sum(additive_identity,additive_identity,a)), inference(etableau_closure_rule, [i_0_92, ...])). % 0.46/0.69 cnf(i_0_109, plain, (~sum(c,additive_identity,additive_identity)), inference(etableau_closure_rule, [i_0_109, ...])). % 0.46/0.69 # End printing tableau % 0.46/0.69 # SZS output end % 0.46/0.69 # Branches closed with saturation will be marked with an "s" % 0.46/0.69 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.46/0.69 # We now have 4 tableaux to operate on % 0.46/0.69 # Found closed tableau during pool population. % 0.46/0.69 # Proof search is over... % 0.46/0.69 # Freeing feature tree %------------------------------------------------------------------------------