%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP705-1 : TPTP v8.1.0. Released v4.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 : 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 : Sat Jul 16 09:08:08 EDT 2022 % Result : Unsatisfiable 95.79s 12.66s % Output : CNFRefutation 95.79s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP705-1 : TPTP v8.1.0. Released v4.0.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.12/0.34 % Computer : n019.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 14 10:39:24 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.12/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Number of axioms: 10 Number of unprocessed: 10 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 10 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 10 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 0 extension rule candidate clauses % 0.12/0.37 # 10 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 17 tableaux to operate on % 95.79/12.66 # There were 1 total branch saturation attempts. % 95.79/12.66 # There were 0 of these attempts blocked. % 95.79/12.66 # There were 0 deferred branch saturation attempts. % 95.79/12.66 # There were 0 free duplicated saturations. % 95.79/12.66 # There were 1 total successful branch saturations. % 95.79/12.66 # There were 0 successful branch saturations in interreduction. % 95.79/12.66 # There were 0 successful branch saturations on the branch. % 95.79/12.66 # There were 1 successful branch saturations after the branch. % 95.79/12.66 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 95.79/12.66 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 95.79/12.66 # Begin clausification derivation % 95.79/12.66 % 95.79/12.66 # End clausification derivation % 95.79/12.66 # Begin listing active clauses obtained from FOF to CNF conversion % 95.79/12.66 cnf(i_0_15, plain, (mult(X1,unit)=X1)). % 95.79/12.66 cnf(i_0_16, plain, (mult(unit,X1)=X1)). % 95.79/12.66 cnf(i_0_12, plain, (ld(X1,mult(X1,X2))=X2)). % 95.79/12.66 cnf(i_0_11, plain, (mult(X1,ld(X1,X2))=X2)). % 95.79/12.66 cnf(i_0_13, plain, (mult(rd(X1,X2),X2)=X1)). % 95.79/12.66 cnf(i_0_14, plain, (rd(mult(X1,X2),X2)=X1)). % 95.79/12.66 cnf(i_0_18, plain, (mult(op_a,mult(op_a,mult(op_a,op_a)))=unit)). % 95.79/12.66 cnf(i_0_20, negated_conjecture, (mult(mult(op_a,op_b),a)!=mult(op_a,mult(op_b,a)))). % 95.79/12.66 cnf(i_0_17, plain, (mult(mult(mult(X1,X2),X2),X3)=mult(X1,mult(X2,mult(X2,X3))))). % 95.79/12.66 cnf(i_0_19, plain, (mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,mult(op_b,op_b))))))))=unit)). % 95.79/12.66 cnf(i_0_22, plain, (X4=X4)). % 95.79/12.66 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 95.79/12.66 # Begin printing tableau % 95.79/12.66 # Found 6 steps % 95.79/12.66 cnf(i_0_15, plain, (mult(X7,unit)=X7), inference(start_rule)). % 95.79/12.66 cnf(i_0_29, plain, (mult(X7,unit)=X7), inference(extension_rule, [i_0_27])). % 95.79/12.66 cnf(i_0_52, plain, (mult(unit,unit)!=unit), inference(closure_rule, [i_0_15])). % 95.79/12.66 cnf(i_0_50, plain, (mult(mult(X7,unit),mult(unit,unit))=mult(X7,unit)), inference(extension_rule, [i_0_25])). % 95.79/12.66 cnf(i_0_62, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_15])). % 95.79/12.66 cnf(i_0_60, plain, (mult(mult(X7,unit),mult(unit,unit))=X7), inference(etableau_closure_rule, [i_0_60, ...])). % 95.79/12.66 # End printing tableau % 95.79/12.66 # SZS output end % 95.79/12.66 # Branches closed with saturation will be marked with an "s" % 96.45/12.69 # Child (1820) has found a proof. % 96.45/12.69 % 96.45/12.69 # Proof search is over... % 96.45/12.69 # Freeing feature tree %------------------------------------------------------------------------------