%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COM010-2 : TPTP v8.1.0. Released v3.2.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 : n003.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 : Fri Jul 15 01:14:55 EDT 2022 % Result : Unsatisfiable 0.19s 0.35s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.11 % Problem : COM010-2 : TPTP v8.1.0. Released v3.2.0. % 0.02/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.32 % Computer : n003.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Thu Jun 16 16:48:41 EDT 2022 % 0.12/0.32 % CPUTime : % 0.12/0.35 # No SInE strategy applied % 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.35 # % 0.12/0.35 # Presaturation interreduction done % 0.12/0.35 # Number of axioms: 5 Number of unprocessed: 5 % 0.12/0.35 # Tableaux proof search. % 0.12/0.35 # APR header successfully linked. % 0.12/0.35 # Hello from C++ % 0.12/0.35 # The folding up rule is enabled... % 0.12/0.35 # Local unification is enabled... % 0.12/0.35 # Any saturation attempts will use folding labels... % 0.12/0.35 # 5 beginning clauses after preprocessing and clausification % 0.12/0.35 # Creating start rules for all 4 conjectures. % 0.12/0.35 # There are 4 start rule candidates: % 0.12/0.35 # Found 5 unit axioms. % 0.12/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.35 # 4 start rule tableaux created. % 0.12/0.35 # 0 extension rule candidate clauses % 0.12/0.35 # 5 unit axiom clauses % 0.12/0.35 % 0.12/0.35 # Requested 8, 32 cores available to the main process. % 0.12/0.35 # There are not enough tableaux to fork, creating more from the initial 4 % 0.12/0.35 # Creating equality axioms % 0.12/0.35 # Ran out of tableaux, making start rules for all clauses % 0.12/0.35 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux. % 0.12/0.35 # We now have 22 tableaux to operate on % 0.19/0.35 # There were 1 total branch saturation attempts. % 0.19/0.35 # There were 0 of these attempts blocked. % 0.19/0.35 # There were 0 deferred branch saturation attempts. % 0.19/0.35 # There were 0 free duplicated saturations. % 0.19/0.35 # There were 1 total successful branch saturations. % 0.19/0.35 # There were 0 successful branch saturations in interreduction. % 0.19/0.35 # There were 0 successful branch saturations on the branch. % 0.19/0.35 # There were 1 successful branch saturations after the branch. % 0.19/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 # Begin clausification derivation % 0.19/0.35 % 0.19/0.35 # End clausification derivation % 0.19/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.35 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a))). % 0.19/0.35 cnf(i_0_7, negated_conjecture, (c_UNITY_OActs(v_G,t_a)=c_UNITY_OActs(v_F,t_a))). % 0.19/0.35 cnf(i_0_8, negated_conjecture, (c_UNITY_OAllowedActs(v_G,t_a)=c_UNITY_OAllowedActs(v_F,t_a))). % 0.19/0.35 cnf(i_0_10, plain, (c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)=X1)). % 0.19/0.35 cnf(i_0_9, negated_conjecture, (v_G!=v_F)). % 0.19/0.35 cnf(i_0_15, plain, (X3=X3)). % 0.19/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.35 # Begin printing tableau % 0.19/0.35 # Found 6 steps % 0.19/0.35 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(start_rule)). % 0.19/0.35 cnf(i_0_26, plain, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(extension_rule, [i_0_25])). % 0.19/0.35 cnf(i_0_59, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.35 cnf(i_0_58, plain, (c_UNITY_Omk__program(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))), inference(extension_rule, [i_0_18])). % 0.19/0.35 cnf(i_0_67, plain, (c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))!=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(closure_rule, [i_0_10])). % 0.19/0.35 cnf(i_0_65, plain, (c_UNITY_Omk__program(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.19/0.35 # End printing tableau % 0.19/0.35 # SZS output end % 0.19/0.35 # Branches closed with saturation will be marked with an "s" % 0.19/0.35 # There were 1 total branch saturation attempts. % 0.19/0.35 # There were 0 of these attempts blocked. % 0.19/0.35 # There were 0 deferred branch saturation attempts. % 0.19/0.35 # There were 0 free duplicated saturations. % 0.19/0.35 # There were 1 total successful branch saturations. % 0.19/0.35 # There were 0 successful branch saturations in interreduction. % 0.19/0.35 # There were 0 successful branch saturations on the branch. % 0.19/0.35 # There were 1 successful branch saturations after the branch. % 0.19/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 # Begin clausification derivation % 0.19/0.35 % 0.19/0.35 # End clausification derivation % 0.19/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.35 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a))). % 0.19/0.35 cnf(i_0_7, negated_conjecture, (c_UNITY_OActs(v_G,t_a)=c_UNITY_OActs(v_F,t_a))). % 0.19/0.35 cnf(i_0_8, negated_conjecture, (c_UNITY_OAllowedActs(v_G,t_a)=c_UNITY_OAllowedActs(v_F,t_a))). % 0.19/0.35 cnf(i_0_10, plain, (c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)=X1)). % 0.19/0.35 cnf(i_0_9, negated_conjecture, (v_G!=v_F)). % 0.19/0.35 cnf(i_0_15, plain, (X3=X3)). % 0.19/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.35 # Begin printing tableau % 0.19/0.35 # Found 8 steps % 0.19/0.35 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(start_rule)). % 0.19/0.35 cnf(i_0_26, plain, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(extension_rule, [i_0_24])). % 0.19/0.35 cnf(i_0_54, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.35 cnf(i_0_55, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.35 cnf(i_0_56, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.35 cnf(i_0_53, plain, (c_Pair(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))), inference(extension_rule, [i_0_18])). % 0.19/0.35 cnf(i_0_67, plain, (c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))!=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(closure_rule, [i_0_10])). % 0.19/0.35 cnf(i_0_65, plain, (c_Pair(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.19/0.35 # End printing tableau % 0.19/0.35 # SZS output end % 0.19/0.35 # Branches closed with saturation will be marked with an "s" % 0.19/0.35 # There were 1 total branch saturation attempts. % 0.19/0.35 # There were 0 of these attempts blocked. % 0.19/0.35 # There were 0 deferred branch saturation attempts. % 0.19/0.35 # There were 0 free duplicated saturations. % 0.19/0.35 # There were 1 total successful branch saturations. % 0.19/0.35 # There were 0 successful branch saturations in interreduction. % 0.19/0.35 # There were 0 successful branch saturations on the branch. % 0.19/0.35 # There were 1 successful branch saturations after the branch. % 0.19/0.35 # There were 1 total branch saturation attempts. % 0.19/0.35 # There were 0 of these attempts blocked. % 0.19/0.35 # There were 0 deferred branch saturation attempts. % 0.19/0.35 # There were 0 free duplicated saturations. % 0.19/0.35 # There were 1 total successful branch saturations. % 0.19/0.35 # There were 0 successful branch saturations in interreduction. % 0.19/0.35 # There were 0 successful branch saturations on the branch. % 0.19/0.35 # There were 1 successful branch saturations after the branch. % 0.19/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 # Begin clausification derivation % 0.19/0.35 % 0.19/0.35 # End clausification derivation % 0.19/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.35 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a))). % 0.19/0.35 cnf(i_0_7, negated_conjecture, (c_UNITY_OActs(v_G,t_a)=c_UNITY_OActs(v_F,t_a))). % 0.19/0.35 cnf(i_0_8, negated_conjecture, (c_UNITY_OAllowedActs(v_G,t_a)=c_UNITY_OAllowedActs(v_F,t_a))). % 0.19/0.35 cnf(i_0_10, plain, (c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)=X1)). % 0.19/0.35 cnf(i_0_9, negated_conjecture, (v_G!=v_F)). % 0.19/0.35 cnf(i_0_15, plain, (X3=X3)). % 0.19/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.35 # Begin printing tableau % 0.19/0.35 # Found 8 steps % 0.19/0.35 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(start_rule)). % 0.19/0.35 cnf(i_0_26, plain, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(extension_rule, [i_0_24])). % 0.19/0.35 cnf(i_0_54, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.35 cnf(i_0_55, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.35 cnf(i_0_57, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.35 cnf(i_0_53, plain, (c_Pair(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))), inference(extension_rule, [i_0_18])). % 0.19/0.35 cnf(i_0_67, plain, (c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))!=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(closure_rule, [i_0_10])). % 0.19/0.35 cnf(i_0_65, plain, (c_Pair(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.19/0.35 # End printing tableau % 0.19/0.35 # SZS output end % 0.19/0.35 # Branches closed with saturation will be marked with an "s" % 0.19/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.35 # Begin clausification derivation % 0.19/0.35 % 0.19/0.35 # End clausification derivation % 0.19/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.35 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a))). % 0.19/0.35 cnf(i_0_7, negated_conjecture, (c_UNITY_OActs(v_G,t_a)=c_UNITY_OActs(v_F,t_a))). % 0.19/0.35 cnf(i_0_8, negated_conjecture, (c_UNITY_OAllowedActs(v_G,t_a)=c_UNITY_OAllowedActs(v_F,t_a))). % 0.19/0.35 cnf(i_0_10, plain, (c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)=X1)). % 0.19/0.36 cnf(i_0_9, negated_conjecture, (v_G!=v_F)). % 0.19/0.36 cnf(i_0_15, plain, (X3=X3)). % 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.36 # Begin printing tableau % 0.19/0.36 # Found 6 steps % 0.19/0.36 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(start_rule)). % 0.19/0.36 cnf(i_0_26, plain, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(extension_rule, [i_0_25])). % 0.19/0.36 cnf(i_0_60, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.36 cnf(i_0_58, plain, (c_UNITY_Omk__program(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))), inference(extension_rule, [i_0_18])). % 0.19/0.36 cnf(i_0_67, plain, (c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))!=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(closure_rule, [i_0_10])). % 0.19/0.36 cnf(i_0_65, plain, (c_UNITY_Omk__program(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_UNITY_Omk__program(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.19/0.36 # End printing tableau % 0.19/0.36 # SZS output end % 0.19/0.36 # Branches closed with saturation will be marked with an "s" % 0.19/0.36 # There were 1 total branch saturation attempts. % 0.19/0.36 # There were 0 of these attempts blocked. % 0.19/0.36 # There were 0 deferred branch saturation attempts. % 0.19/0.36 # There were 0 free duplicated saturations. % 0.19/0.36 # There were 1 total successful branch saturations. % 0.19/0.36 # There were 0 successful branch saturations in interreduction. % 0.19/0.36 # There were 0 successful branch saturations on the branch. % 0.19/0.36 # There were 1 successful branch saturations after the branch. % 0.19/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.36 # Begin clausification derivation % 0.19/0.36 % 0.19/0.36 # End clausification derivation % 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.36 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a))). % 0.19/0.36 cnf(i_0_7, negated_conjecture, (c_UNITY_OActs(v_G,t_a)=c_UNITY_OActs(v_F,t_a))). % 0.19/0.36 cnf(i_0_8, negated_conjecture, (c_UNITY_OAllowedActs(v_G,t_a)=c_UNITY_OAllowedActs(v_F,t_a))). % 0.19/0.36 cnf(i_0_10, plain, (c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)=X1)). % 0.19/0.36 cnf(i_0_9, negated_conjecture, (v_G!=v_F)). % 0.19/0.36 cnf(i_0_15, plain, (X3=X3)). % 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.36 # Begin printing tableau % 0.19/0.36 # Found 8 steps % 0.19/0.36 cnf(i_0_6, negated_conjecture, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(start_rule)). % 0.19/0.36 cnf(i_0_26, plain, (c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a)), inference(extension_rule, [i_0_24])). % 0.19/0.36 cnf(i_0_54, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.36 cnf(i_0_56, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.36 cnf(i_0_57, plain, (c_UNITY_OInit(v_G,t_a)!=c_UNITY_OInit(v_F,t_a)), inference(closure_rule, [i_0_6])). % 0.19/0.36 cnf(i_0_53, plain, (c_Pair(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))), inference(extension_rule, [i_0_18])). % 0.19/0.36 cnf(i_0_67, plain, (c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a))!=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(closure_rule, [i_0_10])). % 0.19/0.36 cnf(i_0_65, plain, (c_Pair(c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a),c_UNITY_OInit(v_G,t_a))=c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_Pair(c_UNITY_OActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),c_UNITY_OAllowedActs(c_Pair(c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a),c_UNITY_OInit(v_F,t_a)),X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2)), inference(etableau_closure_rule, [i_0_65, ...])). % 0.19/0.36 # End printing tableau % 0.19/0.36 # SZS output end % 0.19/0.36 # Branches closed with saturation will be marked with an "s" % 0.19/0.36 # Child (9242) has found a proof. % 0.19/0.36 # There were 1 total branch saturation attempts. % 0.19/0.36 # There were 0 of these attempts blocked. % 0.19/0.36 # There were 0 deferred branch saturation attempts. % 0.19/0.36 # There were 0 free duplicated saturations. % 0.19/0.36 # There were 1 total successful branch saturations. % 0.19/0.36 # There were 0 successful branch saturations in interreduction. % 0.19/0.36 # There were 0 successful branch saturations on the branch. % 0.19/0.36 # There were 1 successful branch saturations after the branch. % 0.19/0.36 % 0.19/0.36 # Proof search is over... % 0.19/0.36 # Freeing feature tree %------------------------------------------------------------------------------