%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG011-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 : n018.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:04 EDT 2022 % Result : Unsatisfiable 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.01/0.12 % Problem : RNG011-5 : TPTP v8.1.0. Released v1.0.0. % 0.13/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 : n018.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 : Mon May 30 19:53:42 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.20/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Number of axioms: 20 Number of unprocessed: 20 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 20 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 1 conjectures. % 0.20/0.38 # There are 1 start rule candidates: % 0.20/0.38 # Found 20 unit axioms. % 0.20/0.38 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done. % 0.20/0.38 # Found closed tableau while making start rule % 0.20/0.38 # There were 0 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 0 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 0 successful branch saturations after the branch. % 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_29, plain, (additive_inverse(additive_identity)=additive_identity)). % 0.20/0.38 cnf(i_0_32, plain, (additive_inverse(additive_inverse(X1))=X1)). % 0.20/0.38 cnf(i_0_33, plain, (multiply(X1,additive_identity)=additive_identity)). % 0.20/0.38 cnf(i_0_34, plain, (multiply(additive_identity,X1)=additive_identity)). % 0.20/0.38 cnf(i_0_25, plain, (add(X1,additive_identity)=X1)). % 0.20/0.38 cnf(i_0_26, plain, (add(additive_identity,X1)=X1)). % 0.20/0.38 cnf(i_0_27, plain, (add(X1,additive_inverse(X1))=additive_identity)). % 0.20/0.38 cnf(i_0_28, plain, (add(additive_inverse(X1),X1)=additive_identity)). % 0.20/0.38 cnf(i_0_23, plain, (add(X1,X2)=add(X2,X1))). % 0.20/0.38 cnf(i_0_35, plain, (multiply(additive_inverse(X1),additive_inverse(X2))=multiply(X1,X2))). % 0.20/0.38 cnf(i_0_36, plain, (additive_inverse(multiply(X1,X2))=multiply(X1,additive_inverse(X2)))). % 0.20/0.38 cnf(i_0_37, plain, (additive_inverse(multiply(X1,X2))=multiply(additive_inverse(X1),X2))). % 0.20/0.38 cnf(i_0_30, plain, (add(X1,add(additive_inverse(X1),X2))=X2)). % 0.20/0.38 cnf(i_0_31, plain, (add(additive_inverse(X1),additive_inverse(X2))=additive_inverse(add(X1,X2)))). % 0.20/0.38 cnf(i_0_24, plain, (add(add(X1,X2),X3)=add(X1,add(X2,X3)))). % 0.20/0.38 cnf(i_0_40, plain, (multiply(multiply(X1,X2),X2)=multiply(X1,multiply(X2,X2)))). % 0.20/0.38 cnf(i_0_38, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))). % 0.20/0.38 cnf(i_0_39, plain, (add(multiply(X1,X3),multiply(X2,X3))=multiply(add(X1,X2),X3))). % 0.20/0.38 cnf(i_0_43, plain, (multiply(multiply(add(multiply(multiply(X1,X1),X2),additive_inverse(multiply(X1,multiply(X1,X2)))),X1),add(multiply(multiply(X1,X1),X2),additive_inverse(multiply(X1,multiply(X1,X2)))))=additive_identity)). % 0.20/0.38 cnf(i_0_44, negated_conjecture, (multiply(multiply(add(multiply(multiply(a,a),b),additive_inverse(multiply(a,multiply(a,b)))),a),add(multiply(multiply(a,a),b),additive_inverse(multiply(a,multiply(a,b)))))!=additive_identity)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 2 steps % 0.20/0.38 cnf(i_0_44, negated_conjecture, (multiply(multiply(add(multiply(multiply(a,a),b),additive_inverse(multiply(a,multiply(a,b)))),a),add(multiply(multiply(a,a),b),additive_inverse(multiply(a,multiply(a,b)))))!=additive_identity), inference(start_rule)). % 0.20/0.38 cnf(i_0_45, plain, (multiply(multiply(add(multiply(multiply(a,a),b),additive_inverse(multiply(a,multiply(a,b)))),a),add(multiply(multiply(a,a),b),additive_inverse(multiply(a,multiply(a,b)))))!=additive_identity), inference(closure_rule, [i_0_43])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # NOT attempting initial tableau saturation % 0.20/0.38 # 1 start rule tableaux created. % 0.20/0.38 # 0 extension rule candidate clauses % 0.20/0.38 # 20 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------