%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP670-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 : n005.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:07:55 EDT 2022 % Result : Unsatisfiable 106.57s 13.79s % Output : CNFRefutation 106.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GRP670-1 : TPTP v8.1.0. Released v4.0.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.34 % Computer : n005.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 : Mon Jun 13 16:06:39 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.19/0.37 # and selection function SelectNewComplexAHP. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 10 Number of unprocessed: 10 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 10 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 1 conjectures. % 0.19/0.37 # There are 1 start rule candidates: % 0.19/0.37 # Found 10 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 0 extension rule candidate clauses % 0.19/0.37 # 10 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 18 tableaux to operate on % 106.57/13.79 # There were 1 total branch saturation attempts. % 106.57/13.79 # There were 0 of these attempts blocked. % 106.57/13.79 # There were 0 deferred branch saturation attempts. % 106.57/13.79 # There were 0 free duplicated saturations. % 106.57/13.79 # There were 1 total successful branch saturations. % 106.57/13.79 # There were 0 successful branch saturations in interreduction. % 106.57/13.79 # There were 0 successful branch saturations on the branch. % 106.57/13.79 # There were 1 successful branch saturations after the branch. % 106.57/13.79 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 106.57/13.79 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 106.57/13.79 # Begin clausification derivation % 106.57/13.79 % 106.57/13.79 # End clausification derivation % 106.57/13.79 # Begin listing active clauses obtained from FOF to CNF conversion % 106.57/13.79 cnf(i_0_15, plain, (mult(X1,unit)=X1)). % 106.57/13.79 cnf(i_0_16, plain, (mult(unit,X1)=X1)). % 106.57/13.79 cnf(i_0_12, plain, (ld(X1,mult(X1,X2))=X2)). % 106.57/13.79 cnf(i_0_11, plain, (mult(X1,ld(X1,X2))=X2)). % 106.57/13.79 cnf(i_0_13, plain, (mult(rd(X1,X2),X2)=X1)). % 106.57/13.79 cnf(i_0_14, plain, (rd(mult(X1,X2),X2)=X1)). % 106.57/13.79 cnf(i_0_17, plain, (mult(i(X1),mult(X1,X2))=X2)). % 106.57/13.79 cnf(i_0_18, plain, (mult(mult(X1,X2),i(X2))=X1)). % 106.57/13.79 cnf(i_0_19, plain, (mult(mult(mult(X1,mult(X2,X3)),X1),X2)=mult(mult(X1,X2),mult(X3,mult(X1,X2))))). % 106.57/13.79 cnf(i_0_20, negated_conjecture, (mult(mult(a,mult(mult(b,c),b)),c)!=mult(mult(a,b),mult(mult(c,b),c)))). % 106.57/13.79 cnf(i_0_22, plain, (X4=X4)). % 106.57/13.79 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 106.57/13.79 # Begin printing tableau % 106.57/13.79 # Found 6 steps % 106.57/13.79 cnf(i_0_15, plain, (mult(X3,unit)=X3), inference(start_rule)). % 106.57/13.79 cnf(i_0_30, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_26])). % 106.57/13.79 cnf(i_0_50, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_15])). % 106.57/13.79 cnf(i_0_48, plain, (ld(mult(X3,unit),mult(X5,unit))=ld(X3,X5)), inference(extension_rule, [i_0_25])). % 106.57/13.79 cnf(i_0_65, plain, (ld(X3,X5)!=mult(ld(X3,X5),unit)), inference(closure_rule, [i_0_15])). % 106.57/13.79 cnf(i_0_63, plain, (ld(mult(X3,unit),mult(X5,unit))=mult(ld(X3,X5),unit)), inference(etableau_closure_rule, [i_0_63, ...])). % 106.57/13.79 # End printing tableau % 106.57/13.79 # SZS output end % 106.57/13.79 # Branches closed with saturation will be marked with an "s" % 107.18/13.84 # Child (4222) has found a proof. % 107.18/13.84 % 107.18/13.84 # Proof search is over... % 107.18/13.84 # Freeing feature tree %------------------------------------------------------------------------------