%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG039-1 : 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 : 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 : Mon Jul 18 20:27:10 EDT 2022 % Result : Unsatisfiable 0.19s 0.40s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : RNG039-1 : TPTP v8.1.0. Released v1.0.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 : n019.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 11:16:10 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 60 Number of unprocessed: 60 % 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 # 60 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 3 conjectures. % 0.19/0.37 # There are 3 start rule candidates: % 0.19/0.37 # Found 49 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 3 start rule tableaux created. % 0.19/0.37 # 11 extension rule candidate clauses % 0.19/0.37 # 49 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 3 % 0.19/0.37 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 21 tableaux to operate on % 0.19/0.40 # There were 2 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 2 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 2 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_118, negated_conjecture, (product(a,b,c))). % 0.19/0.40 cnf(i_0_87, plain, (product(a,c,c))). % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d))). % 0.19/0.40 cnf(i_0_88, plain, (product(b,d,d))). % 0.19/0.40 cnf(i_0_84, plain, (multiply(a,b)=c)). % 0.19/0.40 cnf(i_0_85, plain, (multiply(b,a)=d)). % 0.19/0.40 cnf(i_0_117, plain, (product(X1,X1,X1))). % 0.19/0.40 cnf(i_0_83, plain, (multiply(X1,X1)=X1)). % 0.19/0.40 cnf(i_0_82, plain, (add(X1,X1)=additive_identity)). % 0.19/0.40 cnf(i_0_80, plain, (sum(X1,X1,additive_identity))). % 0.19/0.40 cnf(i_0_89, plain, (product(c,b,c))). % 0.19/0.40 cnf(i_0_90, plain, (product(d,a,d))). % 0.19/0.40 cnf(i_0_102, plain, (product(a,b,multiply(a,c)))). % 0.19/0.40 cnf(i_0_93, plain, (product(a,b,multiply(c,b)))). % 0.19/0.40 cnf(i_0_99, plain, (product(a,d,multiply(c,a)))). % 0.19/0.40 cnf(i_0_81, plain, (add(X1,additive_identity)=X1)). % 0.19/0.40 cnf(i_0_106, plain, (product(b,a,multiply(b,d)))). % 0.19/0.40 cnf(i_0_62, plain, (sum(X1,additive_identity,X1))). % 0.19/0.40 cnf(i_0_61, plain, (sum(additive_identity,X1,X1))). % 0.19/0.40 cnf(i_0_66, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 0.19/0.40 cnf(i_0_65, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 0.19/0.40 cnf(i_0_96, plain, (product(b,a,multiply(d,a)))). % 0.19/0.40 cnf(i_0_98, plain, (product(b,c,multiply(d,b)))). % 0.19/0.40 cnf(i_0_108, plain, (product(c,a,multiply(a,d)))). % 0.19/0.40 cnf(i_0_104, plain, (product(d,b,multiply(b,c)))). % 0.19/0.40 cnf(i_0_94, plain, (product(a,multiply(b,c),c))). % 0.19/0.40 cnf(i_0_97, plain, (product(b,multiply(a,d),d))). % 0.19/0.40 cnf(i_0_103, plain, (product(multiply(c,a),b,c))). % 0.19/0.40 cnf(i_0_86, plain, (sum(X1,X2,add(X2,X1)))). % 0.19/0.40 cnf(i_0_64, plain, (sum(X1,X2,add(X1,X2)))). % 0.19/0.40 cnf(i_0_63, plain, (product(X1,X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_107, plain, (product(multiply(d,b),a,d))). % 0.19/0.40 cnf(i_0_110, plain, (product(a,add(a,b),add(a,c)))). % 0.19/0.40 cnf(i_0_109, plain, (product(a,add(b,a),add(c,a)))). % 0.19/0.40 cnf(i_0_111, plain, (product(b,add(a,b),add(d,b)))). % 0.19/0.40 cnf(i_0_112, plain, (product(b,add(b,a),add(b,d)))). % 0.19/0.40 cnf(i_0_78, plain, (sum(X1,add(X1,X2),X2))). % 0.19/0.40 cnf(i_0_116, plain, (product(add(a,b),a,add(a,d)))). % 0.19/0.40 cnf(i_0_79, plain, (sum(add(X1,X2),X2,X1))). % 0.19/0.40 cnf(i_0_91, plain, (product(X1,multiply(X1,X2),multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_113, plain, (product(add(a,b),b,add(c,b)))). % 0.19/0.40 cnf(i_0_115, plain, (product(add(b,a),a,add(d,a)))). % 0.19/0.40 cnf(i_0_114, plain, (product(add(b,a),b,add(b,c)))). % 0.19/0.40 cnf(i_0_95, plain, (product(b,multiply(a,X1),multiply(d,X1)))). % 0.19/0.40 cnf(i_0_101, plain, (product(multiply(X1,a),b,multiply(X1,c)))). % 0.19/0.40 cnf(i_0_105, plain, (product(multiply(X1,b),a,multiply(X1,d)))). % 0.19/0.40 cnf(i_0_92, plain, (product(a,multiply(b,X1),multiply(X2,X1)))). % 0.19/0.40 cnf(i_0_100, plain, (product(multiply(X1,X2),X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_120, negated_conjecture, (c!=d)). % 0.19/0.40 cnf(i_0_69, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 0.19/0.40 cnf(i_0_76, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.19/0.40 cnf(i_0_68, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_67, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 0.19/0.40 cnf(i_0_71, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.19/0.40 cnf(i_0_70, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.19/0.40 cnf(i_0_75, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_73, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 0.19/0.40 cnf(i_0_72, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 0.19/0.40 cnf(i_0_74, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 7 steps % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d)), inference(start_rule)). % 0.19/0.40 cnf(i_0_122, plain, (product(b,a,d)), inference(extension_rule, [i_0_74])). % 0.19/0.40 cnf(i_0_208, plain, (# There were 2 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 2 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 2 successful branch saturations after the branch. % 0.19/0.40 # There were 2 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 2 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 2 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_118, negated_conjecture, (product(a,b,c))). % 0.19/0.40 cnf(i_0_87, plain, (product(a,c,c))). % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d))). % 0.19/0.40 cnf(i_0_88, plain, (product(b,d,d))). % 0.19/0.40 cnf(i_0_84, plain, (multiply(a,b)=c)). % 0.19/0.40 cnf(i_0_85, plain, (multiply(b,a)=d)). % 0.19/0.40 cnf(i_0_117, plain, (product(X1,X1,X1))). % 0.19/0.40 cnf(i_0_83, plain, (multiply(X1,X1)=X1)). % 0.19/0.40 cnf(i_0_82, plain, (add(X1,X1)=additive_identity)). % 0.19/0.40 cnf(i_0_80, plain, (sum(X1,X1,additive_identity))). % 0.19/0.40 cnf(i_0_89, plain, (product(c,b,c))). % 0.19/0.40 cnf(i_0_90, plain, (product(d,a,d))). % 0.19/0.40 cnf(i_0_102, plain, (product(a,b,multiply(a,c)))). % 0.19/0.40 cnf(i_0_93, plain, (product(a,b,multiply(c,b)))). % 0.19/0.40 cnf(i_0_99, plain, (product(a,d,multiply(c,a)))). % 0.19/0.40 cnf(i_0_81, plain, (add(X1,additive_identity)=X1)). % 0.19/0.40 cnf(i_0_106, plain, (product(b,a,multiply(b,d)))). % 0.19/0.40 cnf(i_0_62, plain, (sum(X1,additive_identity,X1))). % 0.19/0.40 cnf(i_0_61, plain, (sum(additive_identity,X1,X1))). % 0.19/0.40 cnf(i_0_66, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 0.19/0.40 cnf(i_0_65, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 0.19/0.40 cnf(i_0_96, plain, (product(b,a,multiply(d,a)))). % 0.19/0.40 cnf(i_0_98, plain, (product(b,c,multiply(d,b)))). % 0.19/0.40 cnf(i_0_108, plain, (product(c,a,multiply(a,d)))). % 0.19/0.40 cnf(i_0_104, plain, (product(d,b,multiply(b,c)))). % 0.19/0.40 cnf(i_0_94, plain, (product(a,multiply(b,c),c))). % 0.19/0.40 cnf(i_0_97, plain, (product(b,multiply(a,d),d))). % 0.19/0.40 cnf(i_0_103, plain, (product(multiply(c,a),b,c))). % 0.19/0.40 cnf(i_0_86, plain, (sum(X1,X2,add(X2,X1)))). % 0.19/0.40 cnf(i_0_64, plain, (sum(X1,X2,add(X1,X2)))). % 0.19/0.40 cnf(i_0_63, plain, (product(X1,X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_107, plain, (product(multiply(d,b),a,d))). % 0.19/0.40 cnf(i_0_110, plain, (product(a,add(a,b),add(a,c)))). % 0.19/0.40 cnf(i_0_109, plain, (product(a,add(b,a),add(c,a)))). % 0.19/0.40 cnf(i_0_111, plain, (product(b,add(a,b),add(d,b)))). % 0.19/0.40 cnf(i_0_112, plain, (product(b,add(b,a),add(b,d)))). % 0.19/0.40 cnf(i_0_78, plain, (sum(X1,add(X1,X2),X2))). % 0.19/0.40 cnf(i_0_116, plain, (product(add(a,b),a,add(a,d)))). % 0.19/0.40 cnf(i_0_79, plain, (sum(add(X1,X2),X2,X1))). % 0.19/0.40 cnf(i_0_91, plain, (product(X1,multiply(X1,X2),multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_113, plain, (product(add(a,b),b,add(c,b)))). % 0.19/0.40 cnf(i_0_115, plain, (product(add(b,a),a,add(d,a)))). % 0.19/0.40 cnf(i_0_114, plain, (product(add(b,a),b,add(b,c)))). % 0.19/0.40 cnf(i_0_95, plain, (product(b,multiply(a,X1),multiply(d,X1)))). % 0.19/0.40 cnf(i_0_101, plain, (product(multiply(X1,a),b,multiply(X1,c)))). % 0.19/0.40 cnf(i_0_105, plain, (product(multiply(X1,b),a,multiply(X1,d)))). % 0.19/0.40 cnf(i_0_92, plain, (product(a,multiply(b,X1),multiply(X2,X1)))). % 0.19/0.40 cnf(i_0_100, plain, (product(multiply(X1,X2),X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_120, negated_conjecture, (c!=d)). % 0.19/0.40 cnf(i_0_69, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 0.19/0.40 cnf(i_0_76, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.19/0.40 cnf(i_0_68, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_67, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 0.19/0.40 cnf(i_0_71, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.19/0.40 cnf(i_0_70, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.19/0.40 cnf(i_0_75, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_73, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 0.19/0.40 cnf(i_0_72, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 0.19/0.40 cnf(i_0_74, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 8 steps % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d)), inference(start_rule)). % 0.19/0.40 cnf(i_0_122, plain, (product(b,a,d)), inference(extension_rule, [i_0_72])). % 0.19/0.40 cnf(i_0_203, plain, (~product(b,d,d)), inference(closure_rule, [i_0_88])). % 0.19/0.40 cnf(i_0_204, plain, (~product(b,d,d)), inference(closure_rule, [i_0_88])). % 0.19/0.40 cnf(i_0_202, plain, (sum(d,d,d)), inference(extension_rule, [i_0_76])). % 0.19/0.40 cnf(i_0_214, plain, (c=d), inference(closure_rule, [i_0_120])). % 0.19/0.40 cnf(i_0_206, plain, (~sum(a,d,d)), inference(etableau_closure_rule, [i_0_206, ...])). % 0.19/0.40 cnf(i_0_216, plain, (~sum(d,d,c)), inference(etableau_closure_rule, [i_0_216, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_118, negated_conjecture, (product(a,b,c))). % 0.19/0.40 cnf(i_0_87, plain, (product(a,c,c))). % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d))). % 0.19/0.40 cnf(i_0_88, plain, (product(b,d,d))). % 0.19/0.40 cnf(i_0_84, plain, (multiply(a,b)=c)). % 0.19/0.40 cnf(i_0_85, plain, (multiply(b,a)=d)). % 0.19/0.40 cnf(i_0_117, plain, (product(X1,X1,X1))). % 0.19/0.40 cnf(i_0_83, plain, (multiply(X1,X1)=X1)). % 0.19/0.40 cnf(i_0_82, plain, (add(X1,X1)=additive_identity)). % 0.19/0.40 cnf(i_0_80, plain, (sum(X1,X1,additive_identity))). % 0.19/0.40 cnf(i_0_89, plain, (product(c,b,c))). % 0.19/0.40 cnf(i_0_90, plain, (product(d,a,d))). % 0.19/0.40 cnf(i_0_102, plain, (product(a,b,multiply(a,c)))). % 0.19/0.40 cnf(i_0_93, plain, (product(a,b,multiply(c,b)))). % 0.19/0.40 cnf(i_0_99, plain, (product(a,d,multiply(c,a)))). % 0.19/0.40 cnf(i_0_81, plain, (add(X1,additive_identity)=X1)). % 0.19/0.40 cnf(i_0_106, plain, (product(b,a,multiply(b,d)))). % 0.19/0.40 cnf(i_0_62, plain, (sum(X1,additive_identity,X1))). % 0.19/0.40 cnf(i_0_61, plain, (sum(additive_identity,X1,X1))). % 0.19/0.40 cnf(i_0_66, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 0.19/0.40 cnf(i_0_65, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 0.19/0.40 cnf(i_0_96, plain, (product(b,a,multiply(d,a)))). % 0.19/0.40 cnf(i_0_98, plain, (product(b,c,multiply(d,b)))). % 0.19/0.40 cnf(i_0_108, plain, (product(c,a,multiply(a,d)))). % 0.19/0.40 cnf(i_0_104, plain, (product(d,b,multiply(b,c)))). % 0.19/0.40 cnf(i_0_94, plain, (product(a,multiply(b,c),c))). % 0.19/0.40 cnf(i_0_97, plain, (product(b,multiply(a,d),d))). % 0.19/0.40 cnf(i_0_103, plain, (product(multiply(c,a),b,c))). % 0.19/0.40 cnf(i_0_86, plain, (sum(X1,X2,add(X2,X1)))). % 0.19/0.40 cnf(i_0_64, plain, (sum(X1,X2,add(X1,X2)))). % 0.19/0.40 cnf(i_0_63, plain, (product(X1,X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_107, plain, (product(multiply(d,b),a,d))). % 0.19/0.40 cnf(i_0_110, plain, (product(a,add(a,b),add(a,c)))). % 0.19/0.40 cnf(i_0_109, plain, (product(a,add(b,a),add(c,a)))). % 0.19/0.40 cnf(i_0_111, plain, (product(b,add(a,b),add(d,b)))). % 0.19/0.40 cnf(i_0_112, plain, (product(b,add(b,a),add(b,d)))). % 0.19/0.40 cnf(i_0_78, plain, (sum(X1,add(X1,X2),X2))). % 0.19/0.40 cnf(i_0_116, plain, (product(add(a,b),a,add(a,d)))). % 0.19/0.40 cnf(i_0_79, plain, (sum(add(X1,X2),X2,X1))). % 0.19/0.40 cnf(i_0_91, plain, (product(X1,multiply(X1,X2),multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_113, plain, (product(add(a,b),b,add(c,b)))). % 0.19/0.40 cnf(i_0_115, plain, (product(add(b,a),a,add(d,a)))). % 0.19/0.40 cnf(i_0_114, plain, (product(add(b,a),b,add(b,c)))). % 0.19/0.40 cnf(i_0_95, plain, (product(b,multiply(a,X1),multiply(d,X1)))). % 0.19/0.40 cnf(i_0_101, plain, (product(multiply(X1,a),b,multiply(X1,c)))). % 0.19/0.40 cnf(i_0_105, plain, (product(multiply(X1,b),a,multiply(X1,d)))). % 0.19/0.40 cnf(i_0_92, plain, (product(a,multiply(b,X1),multiply(X2,X1)))). % 0.19/0.40 cnf(i_0_100, plain, (product(multiply(X1,X2),X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_120, negated_conjecture, (c!=d)). % 0.19/0.40 cnf(i_0_69, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 0.19/0.40 cnf(i_0_76, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.19/0.40 cnf(i_0_68, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_67, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 0.19/0.40 cnf(i_0_71, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.19/0.40 cnf(i_0_70, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.19/0.40 cnf(i_0_75, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_73, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 0.19/0.40 cnf(i_0_72, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 0.19/0.40 cnf(i_0_74, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 8 steps % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d)), inference(start_rule)). % 0.19/0.40 cnf(i_0_122, plain, (product(b,a,d)), inference(extension_rule, [i_0_72])). % 0.19/0.40 cnf(i_0_203, plain, (~product(b,d,d)), inference(closure_rule, [i_0_88])). % 0.19/0.40 cnf(i_0_205, plain, (~product(b,d,d)), inference(closure_rule, [i_0_88])). % 0.19/0.40 cnf(i_0_202, plain, (sum(d,d,d)), inference(extension_rule, [i_0_76])). % 0.19/0.40 cnf(i_0_214, plain, (c=d), inference(closure_rule, [i_0_120])). % 0.19/0.40 cnf(i_0_206, plain, (~sum(d,a,d)), inference(etableau_closure_rule, [i_0_206, ...])). % 0.19/0.40 cnf(i_0_216, plain, (~sum(d,d,c)), inference(etableau_closure_rule, [i_0_216, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # There were 2 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 2 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 2 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_118, negated_conjecture, (product(a,b,c))). % 0.19/0.40 cnf(i_0_87, plain, (product(a,c,c))). % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d))). % 0.19/0.40 cnf(i_0_88, plain, (product(b,d,d))). % 0.19/0.40 cnf(i_0_84, plain, (multiply(a,b)=c)). % 0.19/0.40 cnf(i_0_85, plain, (multiply(b,a)=d)). % 0.19/0.40 cnf(i_0_117, plain, (product(X1,X1,X1))). % 0.19/0.40 cnf(i_0_83, plain, (multiply(X1,X1)=X1)). % 0.19/0.40 cnf(i_0_82, plain, (add(X1,X1)=additive_identity)). % 0.19/0.40 cnf(i_0_80, plain, (sum(X1,X1,additive_identity))). % 0.19/0.40 cnf(i_0_89, plain, (product(c,b,c))). % 0.19/0.40 cnf(i_0_90, plain, (product(d,a,d))). % 0.19/0.40 cnf(i_0_102, plain, (product(a,b,multiply(a,c)))). % 0.19/0.40 cnf(i_0_93, plain, (product(a,b,multiply(c,b)))). % 0.19/0.40 cnf(i_0_99, plain, (product(a,d,multiply(c,a)))). % 0.19/0.40 cnf(i_0_81, plain, (add(X1,additive_identity)=X1)). % 0.19/0.40 cnf(i_0_106, plain, (product(b,a,multiply(b,d)))). % 0.19/0.40 cnf(i_0_62, plain, (sum(X1,additive_identity,X1))). % 0.19/0.40 cnf(i_0_61, plain, (sum(additive_identity,X1,X1))). % 0.19/0.40 cnf(i_0_66, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 0.19/0.40 cnf(i_0_65, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 0.19/0.40 cnf(i_0_96, plain, (product(b,a,multiply(d,a)))). % 0.19/0.40 cnf(i_0_98, plain, (product(b,c,multiply(d,b)))). % 0.19/0.40 cnf(i_0_108, plain, (product(c,a,multiply(a,d)))). % 0.19/0.40 cnf(i_0_104, plain, (product(d,b,multiply(b,c)))). % 0.19/0.40 cnf(i_0_94, plain, (product(a,multiply(b,c),c))). % 0.19/0.40 cnf(i_0_97, plain, (product(b,multiply(a,d),d))). % 0.19/0.40 cnf(i_0_103, plain, (product(multiply(c,a),b,c))). % 0.19/0.40 cnf(i_0_86, plain, (sum(X1,X2,add(X2,X1)))). % 0.19/0.40 cnf(i_0_64, plain, (sum(X1,X2,add(X1,X2)))). % 0.19/0.40 cnf(i_0_63, plain, (product(X1,X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_107, plain, (product(multiply(d,b),a,d))). % 0.19/0.40 cnf(i_0_110, plain, (product(a,add(a,b),add(a,c)))). % 0.19/0.40 cnf(i_0_109, plain, (product(a,add(b,a),add(c,a)))). % 0.19/0.40 cnf(i_0_111, plain, (product(b,add(a,b),add(d,b)))). % 0.19/0.40 cnf(i_0_112, plain, (product(b,add(b,a),add(b,d)))). % 0.19/0.40 cnf(i_0_78, plain, (sum(X1,add(X1,X2),X2))). % 0.19/0.40 cnf(i_0_116, plain, (product(add(a,b),a,add(a,d)))). % 0.19/0.40 cnf(i_0_79, plain, (sum(add(X1,X2),X2,X1))). % 0.19/0.40 cnf(i_0_91, plain, (product(X1,multiply(X1,X2),multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_113, plain, (product(add(a,b),b,add(c,b)))). % 0.19/0.40 cnf(i_0_115, plain, (product(add(b,a),a,add(d,a)))). % 0.19/0.40 cnf(i_0_114, plain, (product(add(b,a),b,add(b,c)))). % 0.19/0.40 cnf(i_0_95, plain, (product(b,multiply(a,X1),multiply(d,X1)))). % 0.19/0.40 cnf(i_0_101, plain, (product(multiply(X1,a),b,multiply(X1,c)))). % 0.19/0.40 cnf(i_0_105, plain, (product(multiply(X1,b),a,multiply(X1,d)))). % 0.19/0.40 cnf(i_0_92, plain, (product(a,multiply(b,X1),multiply(X2,X1)))). % 0.19/0.40 cnf(i_0_100, plain, (product(multiply(X1,X2),X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_120, negated_conjecture, (c!=d)). % 0.19/0.40 cnf(i_0_69, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 0.19/0.40 cnf(i_0_76, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.19/0.40 cnf(i_0_68, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_67, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 0.19/0.40 cnf(i_0_71, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.19/0.40 cnf(i_0_70, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.19/0.40 cnf(i_0_75, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_73, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 0.19/0.40 cnf(i_0_72, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 0.19/0.40 cnf(i_0_74, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 8 steps % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d)), inference(start_rule)). % 0.19/0.40 cnf(i_0_122, plain, (product(b,a,d)), inference(extension_rule, [i_0_72])). % 0.19/0.40 cnf(i_0_204, plain, (# There were 2 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 2 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 2 successful branch saturations after the branch. % 0.19/0.40 ~product(b,d,d)), inference(closure_rule, [i_0_88])). % 0.19/0.40 cnf(i_0_205, plain, (~product(b,d,d)), inference(closure_rule, [i_0_88])). % 0.19/0.40 cnf(i_0_202, plain, (sum(d,d,d)), inference(extension_rule, [i_0_76])). % 0.19/0.40 cnf(i_0_214, plain, (c=d), inference(closure_rule, [i_0_120])). % 0.19/0.40 cnf(i_0_206, plain, (~sum(d,d,a)), inference(etableau_closure_rule, [i_0_206, ...])). % 0.19/0.40 cnf(i_0_216, plain, (~sum(d,d,c)), inference(etableau_closure_rule, [i_0_216, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_118, negated_conjecture, (product(a,b,c))). % 0.19/0.40 cnf(i_0_87, plain, (product(a,c,c))). % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d))). % 0.19/0.40 cnf(i_0_88, plain, (product(b,d,d))). % 0.19/0.40 cnf(i_0_84, plain, (multiply(a,b)=c)). % 0.19/0.40 cnf(i_0_85, plain, (multiply(b,a)=d)). % 0.19/0.40 cnf(i_0_117, plain, (product(X1,X1,X1))). % 0.19/0.40 cnf(i_0_83, plain, (multiply(X1,X1)=X1)). % 0.19/0.40 cnf(i_0_82, plain, (add(X1,X1)=additive_identity)). % 0.19/0.40 cnf(i_0_80, plain, (sum(X1,X1,additive_identity))). % 0.19/0.40 cnf(i_0_89, plain, (product(c,b,c))). % 0.19/0.40 cnf(i_0_90, plain, (product(d,a,d))). % 0.19/0.40 cnf(i_0_102, plain, (product(a,b,multiply(a,c)))). % 0.19/0.40 cnf(i_0_93, plain, (product(a,b,multiply(c,b)))). % 0.19/0.40 cnf(i_0_99, plain, (product(a,d,multiply(c,a)))). % 0.19/0.40 cnf(i_0_81, plain, (add(X1,additive_identity)=X1)). % 0.19/0.40 cnf(i_0_106, plain, (product(b,a,multiply(b,d)))). % 0.19/0.40 cnf(i_0_62, plain, (sum(X1,additive_identity,X1))). % 0.19/0.40 cnf(i_0_61, plain, (sum(additive_identity,X1,X1))). % 0.19/0.40 cnf(i_0_66, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 0.19/0.40 cnf(i_0_65, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 0.19/0.40 cnf(i_0_96, plain, (product(b,a,multiply(d,a)))). % 0.19/0.40 cnf(i_0_98, plain, (product(b,c,multiply(d,b)))). % 0.19/0.40 cnf(i_0_108, plain, (product(c,a,multiply(a,d)))). % 0.19/0.40 cnf(i_0_104, plain, (product(d,b,multiply(b,c)))). % 0.19/0.40 cnf(i_0_94, plain, (product(a,multiply(b,c),c))). % 0.19/0.40 cnf(i_0_97, plain, (product(b,multiply(a,d),d))). % 0.19/0.40 cnf(i_0_103, plain, (product(multiply(c,a),b,c))). % 0.19/0.40 cnf(i_0_86, plain, (sum(X1,X2,add(X2,X1)))). % 0.19/0.40 cnf(i_0_64, plain, (sum(X1,X2,add(X1,X2)))). % 0.19/0.40 cnf(i_0_63, plain, (product(X1,X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_107, plain, (product(multiply(d,b),a,d))). % 0.19/0.40 cnf(i_0_110, plain, (product(a,add(a,b),add(a,c)))). % 0.19/0.40 cnf(i_0_109, plain, (product(a,add(b,a),add(c,a)))). % 0.19/0.40 cnf(i_0_111, plain, (product(b,add(a,b),add(d,b)))). % 0.19/0.40 cnf(i_0_112, plain, (product(b,add(b,a),add(b,d)))). % 0.19/0.40 cnf(i_0_78, plain, (sum(X1,add(X1,X2),X2))). % 0.19/0.40 cnf(i_0_116, plain, (product(add(a,b),a,add(a,d)))). % 0.19/0.40 cnf(i_0_79, plain, (sum(add(X1,X2),X2,X1))). % 0.19/0.40 cnf(i_0_91, plain, (product(X1,multiply(X1,X2),multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_113, plain, (product(add(a,b),b,add(c,b)))). % 0.19/0.40 cnf(i_0_115, plain, (product(add(b,a),a,add(d,a)))). % 0.19/0.40 cnf(i_0_114, plain, (product(add(b,a),b,add(b,c)))). % 0.19/0.40 cnf(i_0_95, plain, (product(b,multiply(a,X1),multiply(d,X1)))). % 0.19/0.40 cnf(i_0_101, plain, (product(multiply(X1,a),b,multiply(X1,c)))). % 0.19/0.40 cnf(i_0_105, plain, (product(multiply(X1,b),a,multiply(X1,d)))). % 0.19/0.40 cnf(i_0_92, plain, (product(a,multiply(b,X1),multiply(X2,X1)))). % 0.19/0.40 cnf(i_0_100, plain, (product(multiply(X1,X2),X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_120, negated_conjecture, (c!=d)). % 0.19/0.40 cnf(i_0_69, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 0.19/0.40 cnf(i_0_76, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.19/0.40 cnf(i_0_68, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_67, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 0.19/0.40 cnf(i_0_71, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.19/0.40 cnf(i_0_70, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.19/0.40 cnf(i_0_75, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_73, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 0.19/0.40 cnf(i_0_72, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 0.19/0.40 cnf(i_0_74, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 7 steps % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d)), inference(start_rule)). % 0.19/0.40 cnf(i_0_122, plain, (product(b,a,d)), inference(extension_rule, [i_0_74])). % 0.19/0.40 cnf(i_0_208, plain, (~product(a,a,a)), inference(closure_rule, [i_0_117])). % 0.19/0.40 cnf(i_0_209, plain, (~product(a,a,a)), inference(closure_rule, [i_0_117])). % 0.19/0.40 cnf(i_0_207, plain, (sum(d,a,a)), inference(extension_rule, [i_0_69])). % 0.19/0.40 cnf(i_0_211, plain, (~sum(b,a,a)), inference(etableau_closure_rule, [i_0_211, ...])). % 0.19/0.40 cnf(i_0_212, plain, (sum(a,d,a)), inference(etableau_closure_rule, [i_0_212, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 ~product(a,a,a)), inference(closure_rule, [i_0_117])). % 0.19/0.40 cnf(i_0_210, plain, (~product(a,a,a)), inference(closure_rule, [i_0_117])). % 0.19/0.40 cnf(i_0_207, plain, (sum(a,d,a)), inference(extension_rule, [i_0_69])). % 0.19/0.40 cnf(i_0_211, plain, (~sum(a,b,a)), inference(etableau_closure_rule, [i_0_211, ...])). % 0.19/0.40 cnf(i_0_212, plain, (sum(d,a,a)), inference(etableau_closure_rule, [i_0_212, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # There were 2 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 2 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 2 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_118, negated_conjecture, (product(a,b,c))). % 0.19/0.40 cnf(i_0_87, plain, (product(a,c,c))). % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d))). % 0.19/0.40 cnf(i_0_88, plain, (product(b,d,d))). % 0.19/0.40 cnf(i_0_84, plain, (multiply(a,b)=c)). % 0.19/0.40 cnf(i_0_85, plain, (multiply(b,a)=d)). % 0.19/0.40 cnf(i_0_117, plain, (product(X1,X1,X1))). % 0.19/0.40 cnf(i_0_83, plain, (multiply(X1,X1)=X1)). % 0.19/0.40 cnf(i_0_82, plain, (add(X1,X1)=additive_identity)). % 0.19/0.40 cnf(i_0_80, plain, (sum(X1,X1,additive_identity))). % 0.19/0.40 cnf(i_0_89, plain, (product(c,b,c))). % 0.19/0.40 cnf(i_0_90, plain, (product(d,a,d))). % 0.19/0.40 cnf(i_0_102, plain, (product(a,b,multiply(a,c)))). % 0.19/0.40 cnf(i_0_93, plain, (product(a,b,multiply(c,b)))). % 0.19/0.40 cnf(i_0_99, plain, (product(a,d,multiply(c,a)))). % 0.19/0.40 cnf(i_0_81, plain, (add(X1,additive_identity)=X1)). % 0.19/0.40 cnf(i_0_106, plain, (product(b,a,multiply(b,d)))). % 0.19/0.40 cnf(i_0_62, plain, (sum(X1,additive_identity,X1))). % 0.19/0.40 cnf(i_0_61, plain, (sum(additive_identity,X1,X1))). % 0.19/0.40 cnf(i_0_66, plain, (sum(X1,additive_inverse(X1),additive_identity))). % 0.19/0.40 cnf(i_0_65, plain, (sum(additive_inverse(X1),X1,additive_identity))). % 0.19/0.40 cnf(i_0_96, plain, (product(b,a,multiply(d,a)))). % 0.19/0.40 cnf(i_0_98, plain, (product(b,c,multiply(d,b)))). % 0.19/0.40 cnf(i_0_108, plain, (product(c,a,multiply(a,d)))). % 0.19/0.40 cnf(i_0_104, plain, (product(d,b,multiply(b,c)))). % 0.19/0.40 cnf(i_0_94, plain, (product(a,multiply(b,c),c))). % 0.19/0.40 cnf(i_0_97, plain, (product(b,multiply(a,d),d))). % 0.19/0.40 cnf(i_0_103, plain, (product(multiply(c,a),b,c))). % 0.19/0.40 cnf(i_0_86, plain, (sum(X1,X2,add(X2,X1)))). % 0.19/0.40 cnf(i_0_64, plain, (sum(X1,X2,add(X1,X2)))). % 0.19/0.40 cnf(i_0_63, plain, (product(X1,X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_107, plain, (product(multiply(d,b),a,d))). % 0.19/0.40 cnf(i_0_110, plain, (product(a,add(a,b),add(a,c)))). % 0.19/0.40 cnf(i_0_109, plain, (product(a,add(b,a),add(c,a)))). % 0.19/0.40 cnf(i_0_111, plain, (product(b,add(a,b),add(d,b)))). % 0.19/0.40 cnf(i_0_112, plain, (product(b,add(b,a),add(b,d)))). % 0.19/0.40 cnf(i_0_78, plain, (sum(X1,add(X1,X2),X2))). % 0.19/0.40 cnf(i_0_116, plain, (product(add(a,b),a,add(a,d)))). % 0.19/0.40 cnf(i_0_79, plain, (sum(add(X1,X2),X2,X1))). % 0.19/0.40 cnf(i_0_91, plain, (product(X1,multiply(X1,X2),multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_113, plain, (product(add(a,b),b,add(c,b)))). % 0.19/0.40 cnf(i_0_115, plain, (product(add(b,a),a,add(d,a)))). % 0.19/0.40 cnf(i_0_114, plain, (product(add(b,a),b,add(b,c)))). % 0.19/0.40 cnf(i_0_95, plain, (product(b,multiply(a,X1),multiply(d,X1)))). % 0.19/0.40 cnf(i_0_101, plain, (product(multiply(X1,a),b,multiply(X1,c)))). % 0.19/0.40 cnf(i_0_105, plain, (product(multiply(X1,b),a,multiply(X1,d)))). % 0.19/0.40 cnf(i_0_92, plain, (product(a,multiply(b,X1),multiply(X2,X1)))). % 0.19/0.40 cnf(i_0_100, plain, (product(multiply(X1,X2),X2,multiply(X1,X2)))). % 0.19/0.40 cnf(i_0_120, negated_conjecture, (c!=d)). % 0.19/0.40 cnf(i_0_69, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))). % 0.19/0.40 cnf(i_0_76, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))). % 0.19/0.40 cnf(i_0_77, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.19/0.40 cnf(i_0_68, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_67, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))). % 0.19/0.40 cnf(i_0_71, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))). % 0.19/0.40 cnf(i_0_70, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.19/0.40 cnf(i_0_75, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))). % 0.19/0.40 cnf(i_0_73, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))). % 0.19/0.40 cnf(i_0_72, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))). % 0.19/0.40 cnf(i_0_74, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 8 steps % 0.19/0.40 cnf(i_0_119, negated_conjecture, (product(b,a,d)), inference(start_rule)). % 0.19/0.40 cnf(i_0_122, plain, (product(b,a,d)), inference(extension_rule, [i_0_74])). % 0.19/0.40 cnf(i_0_209, plain, (~product(a,a,a)), inference(closure_rule, [i_0_117])). % 0.19/0.40 cnf(i_0_210, plain, (~product(a,a,a)), inference(closure_rule, [i_0_117])). % 0.19/0.40 cnf(i_0_207, plain, (sum(a,a,d)), inference(extension_rule, [i_0_76])). % 0.19/0.40 cnf(i_0_214, plain, (c=d), inference(closure_rule, [i_0_120])). % 0.19/0.40 cnf(i_0_211, plain, (~sum(a,a,b)), inference(etableau_closure_rule, [i_0_211, ...])). % 0.19/0.40 cnf(i_0_216, plain, (~sum(a,a,c)), inference(etableau_closure_rule, [i_0_216, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # Child (12128) has found a proof. % 0.19/0.40 % 0.19/0.41 # Proof search is over... % 0.19/0.41 # Freeing feature tree %------------------------------------------------------------------------------