%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP780+1 : TPTP v8.1.0. Released v4.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 : n015.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 : Sat Jul 16 09:08:26 EDT 2022 % Result : Theorem 1.67s 0.61s % Output : CNFRefutation 1.67s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : GRP780+1 : TPTP v8.1.0. Released v4.1.0. % 0.03/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 : n015.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 Jun 13 15:01:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 13 Number of unprocessed: 13 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 13 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 1 conjectures. % 0.18/0.36 # There are 1 start rule candidates: % 0.18/0.36 # Found 11 unit axioms. % 0.18/0.36 # 1 start rule tableaux created. % 0.18/0.36 # 2 extension rule candidate clauses % 0.18/0.36 # 11 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.36 # Creating equality axioms % 0.18/0.36 # Ran out of tableaux, making start rules for all clauses % 0.18/0.36 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.18/0.36 # We now have 15 tableaux to operate on % 1.67/0.61 # There were 1 total branch saturation attempts. % 1.67/0.61 # There were 0 of these attempts blocked. % 1.67/0.61 # There were 0 deferred branch saturation attempts. % 1.67/0.61 # There were 0 free duplicated saturations. % 1.67/0.61 # There were 1 total successful branch saturations. % 1.67/0.61 # There were 0 successful branch saturations in interreduction. % 1.67/0.61 # There were 0 successful branch saturations on the branch. % 1.67/0.61 # There were 1 successful branch saturations after the branch. % 1.67/0.61 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.67/0.61 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.67/0.61 # Begin clausification derivation % 1.67/0.61 % 1.67/0.61 # End clausification derivation % 1.67/0.61 # Begin listing active clauses obtained from FOF to CNF conversion % 1.67/0.61 cnf(i_0_11, plain, (d(a1,a2,a3))). % 1.67/0.61 cnf(i_0_12, plain, (d(b1,b2,b3))). % 1.67/0.61 cnf(i_0_13, plain, (d(c1,c2,c3))). % 1.67/0.61 cnf(i_0_6, plain, (product(X1,X1)=X1)). % 1.67/0.61 cnf(i_0_2, plain, (product(X1,difference(X1,X2))=X2)). % 1.67/0.61 cnf(i_0_1, plain, (difference(X1,product(X1,X2))=X2)). % 1.67/0.61 cnf(i_0_4, plain, (product(quotient(X1,X2),X2)=X1)). % 1.67/0.61 cnf(i_0_3, plain, (quotient(product(X1,X2),X2)=X1)). % 1.67/0.61 cnf(i_0_7, plain, (product(product(product(X1,X2),X2),product(X2,product(X2,X1)))=X2)). % 1.67/0.61 cnf(i_0_5, plain, (product(product(X1,X2),product(X3,X4))=product(product(X1,X3),product(X2,X4)))). % 1.67/0.61 cnf(i_0_14, negated_conjecture, (~d(product(product(a1,b3),product(c2,a1)),product(product(a2,b1),product(c3,a2)),product(product(a3,b2),product(c1,a3))))). % 1.67/0.61 cnf(i_0_8, plain, (d(X1,X2,X3)|product(X1,X2)!=product(X2,X3))). % 1.67/0.61 cnf(i_0_9, plain, (product(X1,X2)=product(X2,X3)|~d(X1,X2,X3))). % 1.67/0.61 cnf(i_0_24, plain, (X29=X29)). % 1.67/0.61 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.67/0.61 # Begin printing tableau % 1.67/0.61 # Found 5 steps % 1.67/0.61 cnf(i_0_1, plain, (difference(X6,product(X6,product(X4,X6)))=product(X4,X6)), inference(start_rule)). % 1.67/0.61 cnf(i_0_37, plain, (difference(X6,product(X6,product(X4,X6)))=product(X4,X6)), inference(extension_rule, [i_0_27])). % 1.67/0.61 cnf(i_0_82, plain, (product(X6,difference(X6,difference(X6,product(X6,product(X4,X6)))))!=difference(X6,product(X6,product(X4,X6)))), inference(closure_rule, [i_0_2])). % 1.67/0.61 cnf(i_0_81, plain, (product(X6,difference(X6,difference(X6,product(X6,product(X4,X6)))))=product(X4,X6)), inference(extension_rule, [i_0_8])). % 1.67/0.61 cnf(i_0_84, plain, (d(X4,X6,difference(X6,difference(X6,product(X6,product(X4,X6)))))), inference(etableau_closure_rule, [i_0_84, ...])). % 1.67/0.61 # End printing tableau % 1.67/0.61 # SZS output end % 1.67/0.61 # Branches closed with saturation will be marked with an "s" % 1.67/0.62 # Child (6826) has found a proof. % 1.67/0.62 % 1.67/0.62 # Proof search is over... % 1.67/0.62 # Freeing feature tree %------------------------------------------------------------------------------