%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP348-1 : TPTP v8.1.0. Released v2.5.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 : n023.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:06:05 EDT 2022 % Result : Unsatisfiable 0.20s 0.42s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GRP348-1 : TPTP v8.1.0. Released v2.5.0. % 0.03/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 : n023.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 : Tue Jun 14 01:38:21 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 24 Number of unprocessed: 24 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 24 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 21 conjectures. % 0.20/0.37 # There are 21 start rule candidates: % 0.20/0.37 # Found 3 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 21 start rule tableaux created. % 0.20/0.37 # 21 extension rule candidate clauses % 0.20/0.37 # 3 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.42 # There were 8 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 1 free duplicated saturations. % 0.20/0.42 # There were 8 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 7 successful branch saturations after the branch. % 0.20/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_25, plain, (multiply(identity,X1)=X1)). % 0.20/0.42 cnf(i_0_26, plain, (multiply(inverse(X1),X1)=identity)). % 0.20/0.42 cnf(i_0_27, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 0.20/0.42 cnf(i_0_32, negated_conjecture, (inverse(sk_c1)=sk_c6|inverse(sk_c4)=sk_c5)). % 0.20/0.42 cnf(i_0_40, negated_conjecture, (inverse(sk_c2)=sk_c5|inverse(sk_c4)=sk_c5)). % 0.20/0.42 cnf(i_0_34, negated_conjecture, (inverse(sk_c1)=sk_c6|inverse(sk_c3)=sk_c6)). % 0.20/0.42 cnf(i_0_42, negated_conjecture, (inverse(sk_c2)=sk_c5|inverse(sk_c3)=sk_c6)). % 0.20/0.42 cnf(i_0_28, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c4|inverse(sk_c4)=sk_c5)). % 0.20/0.42 cnf(i_0_36, negated_conjecture, (multiply(sk_c1,sk_c5)=sk_c6|inverse(sk_c4)=sk_c5)). % 0.20/0.42 cnf(i_0_44, negated_conjecture, (multiply(sk_c2,sk_c4)=sk_c5|inverse(sk_c4)=sk_c5)). % 0.20/0.42 cnf(i_0_30, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c4|inverse(sk_c3)=sk_c6)). % 0.20/0.42 cnf(i_0_38, negated_conjecture, (multiply(sk_c1,sk_c5)=sk_c6|inverse(sk_c3)=sk_c6)). % 0.20/0.42 cnf(i_0_46, negated_conjecture, (multiply(sk_c2,sk_c4)=sk_c5|inverse(sk_c3)=sk_c6)). % 0.20/0.42 cnf(i_0_33, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|inverse(sk_c1)=sk_c6)). % 0.20/0.42 cnf(i_0_35, negated_conjecture, (multiply(sk_c3,sk_c5)=sk_c6|inverse(sk_c1)=sk_c6)). % 0.20/0.42 cnf(i_0_41, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|inverse(sk_c2)=sk_c5)). % 0.20/0.42 cnf(i_0_43, negated_conjecture, (multiply(sk_c3,sk_c5)=sk_c6|inverse(sk_c2)=sk_c5)). % 0.20/0.42 cnf(i_0_29, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|multiply(sk_c5,sk_c6)=sk_c4)). % 0.20/0.42 cnf(i_0_31, negated_conjecture, (multiply(sk_c3,sk_c5)=sk_c6|multiply(sk_c5,sk_c6)=sk_c4)). % 0.20/0.42 cnf(i_0_37, negated_conjecture, (multiply(sk_c1,sk_c5)=sk_c6|multiply(sk_c4,sk_c5)=sk_c6)). % 0.20/0.42 cnf(i_0_45, negated_conjecture, (multiply(sk_c2,sk_c4)=sk_c5|multiply(sk_c4,sk_c5)=sk_c6)). % 0.20/0.42 cnf(i_0_39, negated_conjecture, (multiply(sk_c1,sk_c5)=sk_c6|multiply(sk_c3,sk_c5)=sk_c6)). % 0.20/0.42 cnf(i_0_47, negated_conjecture, (multiply(sk_c2,sk_c4)=sk_c5|multiply(sk_c3,sk_c5)=sk_c6)). % 0.20/0.42 cnf(i_0_48, negated_conjecture, (multiply(sk_c5,sk_c6)!=sk_c4|multiply(sk_c4,sk_c5)!=sk_c6|multiply(X1,sk_c5)!=sk_c6|multiply(X2,sk_c4)!=sk_c5|multiply(X3,sk_c5)!=sk_c6|inverse(sk_c4)!=sk_c5|inverse(X1)!=sk_c6|inverse(X2)!=sk_c5|inverse(X3)!=sk_c6)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 13 steps % 0.20/0.42 cnf(i_0_38, negated_conjecture, (multiply(sk_c1,sk_c5)=sk_c6|inverse(sk_c3)=sk_c6), inference(start_rule)). % 0.20/0.42 cnf(i_0_80, plain, (multiply(sk_c1,sk_c5)=sk_c6), inference(extension_rule, [i_0_48])). % 0.20/0.42 cnf(i_0_151, plain, (multiply(sk_c1,sk_c5)!=sk_c6), inference(closure_rule, [i_0_80])). % 0.20/0.42 cnf(i_0_147, plain, (multiply(sk_c5,sk_c6)!=sk_c4), inference(extension_rule, [i_0_31])). % 0.20/0.42 cnf(i_0_81, plain, (inverse(sk_c3)=sk_c6), inference(etableau_closure_rule, [i_0_81, ...])). % 0.20/0.42 cnf(i_0_148, plain, (multiply(sk_c4,sk_c5)!=sk_c6), inference(etableau_closure_rule, [i_0_148, ...])). % 0.20/0.42 cnf(i_0_152, plain, (inverse(sk_c4)!=sk_c5), inference(etableau_closure_rule, [i_0_152, ...])). % 0.20/0.42 cnf(i_0_153, plain, (inverse(sk_c1)!=sk_c6), inference(etableau_closure_rule, [i_0_153, ...])). % 0.20/0.42 cnf(i_0_155, plain, (inverse(sk_c1)!=sk_c6), inference(etableau_closure_rule, [i_0_155, ...])). % 0.20/0.42 cnf(i_0_164, plain, (multiply(sk_c3,sk_c5)=sk_c6), inference(etableau_closure_rule, [i_0_164, ...])). % 0.20/0.42 cnf(i_0_150, plain, (multiply(sk_c2,sk_c4)!=sk_c5), inference(extension_rule, [i_0_47])). % 0.20/0.42 cnf(i_0_154, plain, (inverse(sk_c2)!=sk_c5), inference(etableau_closure_rule, [i_0_154, ...])). % 0.20/0.42 cnf(i_0_2946, plain, (multiply(sk_c3,sk_c5)=sk_c6), inference(etableau_closure_rule, [i_0_2946, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # Child (3004) has found a proof. % 0.20/0.43 % 0.20/0.43 # Proof search is over... % 0.20/0.43 # Freeing feature tree %------------------------------------------------------------------------------