%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL414+1 : TPTP v9.3.1. 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 : n014.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:01:11 PM UTC 2026 % Result : Theorem 0.08s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL414+1 : TPTP v9.3.1. Released v2.5.0. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.35 % Computer : n014.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Sat Sep 5 12:59:42 UTC 2026 % 0.08/0.35 % CPUTime : % 0.08/0.37 # No SInE strategy applied % 0.08/0.37 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V % 0.08/0.37 # and selection function PSelectComplexExceptRRHorn. % 0.08/0.37 # % 0.08/0.37 # Presaturation interreduction done % 0.08/0.37 # Number of axioms: 5 Number of unprocessed: 5 % 0.08/0.37 # Tableaux proof search. % 0.08/0.37 # APR header successfully linked. % 0.08/0.37 # Hello from C++ % 0.08/0.37 # The folding up rule is enabled... % 0.08/0.37 # Local unification is enabled... % 0.08/0.37 # Any saturation attempts will use folding labels... % 0.08/0.37 # 5 beginning clauses after preprocessing and clausification % 0.08/0.37 # Creating start rules for all 5 conjectures. % 0.08/0.37 # There are 5 start rule candidates: % 0.08/0.37 # Found 4 unit axioms. % 0.08/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.08/0.37 # 5 start rule tableaux created. % 0.08/0.37 # 1 extension rule candidate clauses % 0.08/0.37 # 4 unit axiom clauses % 0.08/0.37 % 0.08/0.37 # Requested 8, 32 cores available to the main process. % 0.08/0.37 # There are not enough tableaux to fork, creating more from the initial 5 % 0.08/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.08/0.37 # We now have 8 tableaux to operate on % 0.08/0.37 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.08/0.37 # There were 0 total branch saturation attempts. % 0.08/0.37 # There were 0 of these attempts blocked. % 0.08/0.37 # There were 0 deferred branch saturation attempts. % 0.08/0.37 # There were 0 free duplicated saturations. % 0.08/0.37 # There were 0 total successful branch saturations. % 0.08/0.37 # There were 0 successful branch saturations in interreduction. % 0.08/0.37 # There were 0 successful branch saturations on the branch. % 0.08/0.37 # There were 0 successful branch saturations after the branch. % 0.08/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # Begin clausification derivation % 0.08/0.37 % 0.08/0.37 # End clausification derivation % 0.08/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))). % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). % 0.08/0.37 cnf(i_0_1, negated_conjecture, (~a_truth(implies(esk1_0,esk1_0)))). % 0.08/0.37 cnf(i_0_5, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))). % 0.08/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.37 # Begin printing tableau % 0.08/0.37 # Found 6 steps % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(esk1_0,implies(X7,esk1_0)))), inference(start_rule)). % 0.08/0.37 cnf(i_0_12, plain, (a_truth(implies(esk1_0,implies(X7,esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_25, plain, (a_truth(implies(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 0.08/0.37 cnf(i_0_26, plain, (~a_truth(implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_29, plain, (~a_truth(implies(implies(esk1_0,implies(implies(X7,esk1_0),esk1_0)),implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,esk1_0))))), inference(closure_rule, [i_0_3])). % 0.08/0.37 cnf(i_0_30, plain, (~a_truth(implies(esk1_0,implies(implies(X7,esk1_0),esk1_0)))), inference(closure_rule, [i_0_4])). % 0.08/0.37 # End printing tableau % 0.08/0.37 # SZS output end % 0.08/0.37 # Branches closed with saturation will be marked with an "s" % 0.08/0.37 # There were 1 total branch saturation attempts. % 0.08/0.37 # There were 0 of these attempts blocked. % 0.08/0.37 # There were 0 deferred branch saturation attempts. % 0.08/0.37 # There were 0 free duplicated saturations. % 0.08/0.37 # There were 1 total successful branch saturations. % 0.08/0.37 # There were 0 successful branch saturations in interreduction. % 0.08/0.37 # There were 0 successful branch saturations on the branch. % 0.08/0.37 # There were 1 successful branch saturations after the branch. % 0.08/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # Begin clausification derivation % 0.08/0.37 % 0.08/0.37 # End clausification derivation % 0.08/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))). % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). % 0.08/0.37 cnf(i_0_1, negated_conjecture, (~a_truth(implies(esk1_0,esk1_0)))). % 0.08/0.37 cnf(i_0_5, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))). % 0.08/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.37 # Begin printing tableau % 0.08/0.37 # Found 8 steps % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(implies(esk1_0,implies(X7,esk1_0)),implies(implies(esk1_0,X7),implies(esk1_0,esk1_0))),implies(implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,X7)),implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,esk1_0)))))), inference(start_rule)). % 0.08/0.37 cnf(i_0_10, plain, (a_truth(implies(implies(implies(esk1_0,implies(X7,esk1_0)),implies(implies(esk1_0,X7),implies(esk1_0,esk1_0))),implies(implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,X7)),implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,esk1_0)))))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_21, plain, (~a_truth(implies(implies(esk1_0,implies(X7,esk1_0)),implies(implies(esk1_0,X7),implies(esk1_0,esk1_0))))), inference(closure_rule, [i_0_3])). % 0.08/0.37 cnf(i_0_19, plain, (a_truth(implies(implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,X7)),implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,esk1_0))))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_28, plain, (a_truth(implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_31, plain, (a_truth(implies(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 0.08/0.37 cnf(i_0_33, plain, (~a_truth(implies(esk1_0,implies(X7,esk1_0)))), inference(closure_rule, [i_0_4])). % 0.08/0.37 cnf(i_0_30, plain, (~a_truth(implies(implies(esk1_0,implies(X7,esk1_0)),implies(esk1_0,X7)))), inference(etableau_closure_rule, [i_0_30, ...])). % 0.08/0.37 # End printing tableau % 0.08/0.37 # SZS output end % 0.08/0.37 # Branches closed with saturation will be marked with an "s" % 0.08/0.37 # There were 1 total branch saturation attempts. % 0.08/0.37 # There were 0 of these attempts blocked. % 0.08/0.37 # There were 0 deferred branch saturation attempts. % 0.08/0.37 # There were 0 free duplicated saturations. % 0.08/0.37 # There were 1 total successful branch saturations. % 0.08/0.37 # There were 0 successful branch saturations in interreduction. % 0.08/0.37 # There were 0 successful branch saturations on the branch. % 0.08/0.37 # There were 1 successful branch saturations after the branch. % 0.08/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # Begin clausification derivation % 0.08/0.37 % 0.08/0.37 # End clausification derivation % 0.08/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))). % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). % 0.08/0.37 cnf(i_0_1, negated_conjecture, (~a_truth(implies(esk1_0,esk1_0)))). % 0.08/0.37 cnf(i_0_5, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))). % 0.08/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.37 # Begin printing tableau % 0.08/0.37 # Found 6 steps % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(esk1_0,implies(esk1_0,esk1_0)))), inference(start_rule)). % 0.08/0.37 cnf(i_0_12, plain, (a_truth(implies(esk1_0,implies(esk1_0,esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_25, plain, (a_truth(implies(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 0.08/0.37 cnf(i_0_27, plain, (~a_truth(esk1_0)), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_30, plain, (~a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))))), inference(closure_rule, [i_0_3])). % 0.08/0.37 cnf(i_0_29, plain, (~a_truth(implies(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3))),esk1_0))), inference(etableau_closure_rule, [i_0_29, ...])). % 0.08/0.37 # End printing tableau % 0.08/0.37 # SZS output end % 0.08/0.37 # Branches closed with saturation will be marked with an "s" % 0.08/0.37 # There were 1 total branch saturation attempts. % 0.08/0.37 # There were 0 of these attempts blocked. % 0.08/0.37 # There were 0 deferred branch saturation attempts. % 0.08/0.37 # There were 0 free duplicated saturations. % 0.08/0.37 # There were 1 total successful branch saturations. % 0.08/0.37 # There were 0 successful branch saturations in interreduction. % 0.08/0.37 # There were 0 successful branch saturations on the branch. % 0.08/0.37 # There were 1 successful branch saturations after the branch. % 0.08/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # Begin clausification derivation % 0.08/0.37 % 0.08/0.37 # End clausification derivation % 0.08/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))). % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). % 0.08/0.37 cnf(i_0_1, negated_conjecture, (~a_truth(implies(esk1_0,esk1_0)))). % 0.08/0.37 cnf(i_0_5, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))). % 0.08/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.37 # Begin printing tableau % 0.08/0.37 # Found 6 steps % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(esk1_0),not(esk1_0)),implies(esk1_0,esk1_0)))), inference(start_rule)). % 0.08/0.37 cnf(i_0_11, plain, (a_truth(implies(implies(not(esk1_0),not(esk1_0)),implies(esk1_0,esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_22, plain, (a_truth(implies(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 0.08/0.37 cnf(i_0_24, plain, (~a_truth(implies(not(esk1_0),not(esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_29, plain, (~a_truth(implies(implies(not(not(esk1_0)),not(not(esk1_0))),implies(not(esk1_0),not(esk1_0))))), inference(closure_rule, [i_0_2])). % 0.08/0.37 cnf(i_0_30, plain, (~a_truth(implies(not(not(esk1_0)),not(not(esk1_0))))), inference(etableau_closure_rule, [i_0_30, ...])). % 0.08/0.37 # End printing tableau % 0.08/0.37 # SZS output end % 0.08/0.37 # Branches closed with saturation will be marked with an "s" % 0.08/0.37 # There were 1 total branch saturation attempts. % 0.08/0.37 # There were 0 of these attempts blocked. % 0.08/0.37 # There were 0 deferred branch saturation attempts. % 0.08/0.37 # There were 0 free duplicated saturations. % 0.08/0.37 # There were 1 total successful branch saturations. % 0.08/0.37 # There were 0 successful branch saturations in interreduction. % 0.08/0.37 # There were 0 successful branch saturations on the branch. % 0.08/0.37 # There were 1 successful branch saturations after the branch. % 0.08/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # Begin clausification derivation % 0.08/0.37 % 0.08/0.37 # End clausification derivation % 0.08/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))). % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). % 0.08/0.37 cnf(i_0_1, negated_conjecture, (~a_truth(implies(esk1_0,esk1_0)))). % 0.08/0.37 cnf(i_0_5, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))). % 0.08/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.37 # Begin printing tableau % 0.08/0.37 # Found 6 steps % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X6),not(X5)),implies(X5,X6)))), inference(start_rule)). % 0.08/0.37 cnf(i_0_11, plain, (a_truth(implies(implies(not(X6),not(X5)),implies(X5,X6)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_22, plain, (a_truth(implies(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 0.08/0.37 cnf(i_0_23, plain, (~a_truth(implies(implies(implies(not(X6),not(X5)),implies(X5,X6)),implies(esk1_0,esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_29, plain, (~a_truth(implies(implies(not(implies(esk1_0,esk1_0)),not(implies(implies(not(X6),not(X5)),implies(X5,X6)))),implies(implies(implies(not(X6),not(X5)),implies(X5,X6)),implies(esk1_0,esk1_0))))), inference(closure_rule, [i_0_2])). % 0.08/0.37 cnf(i_0_30, plain, (~a_truth(implies(not(implies(esk1_0,esk1_0)),not(implies(implies(not(X6),not(X5)),implies(X5,X6)))))), inference(etableau_closure_rule, [i_0_30, ...])). % 0.08/0.37 # End printing tableau % 0.08/0.37 # SZS output end % 0.08/0.37 # Branches closed with saturation will be marked with an "s" % 0.08/0.37 # There were 1 total branch saturation attempts. % 0.08/0.37 # There were 0 of these attempts blocked. % 0.08/0.37 # There were 0 deferred branch saturation attempts. % 0.08/0.37 # There were 0 free duplicated saturations. % 0.08/0.37 # There were 1 total successful branch saturations. % 0.08/0.37 # There were 0 successful branch saturations in interreduction. % 0.08/0.37 # There were 0 successful branch saturations on the branch. % 0.08/0.37 # There were 1 successful branch saturations after the branch. % 0.08/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # Begin clausification derivation % 0.08/0.37 % 0.08/0.37 # End clausification derivation % 0.08/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))). % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). % 0.08/0.37 cnf(i_0_1, negated_conjecture, (~a_truth(implies(esk1_0,esk1_0)))). % 0.08/0.37 cnf(i_0_5, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))). % 0.08/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.37 # Begin printing tableau % 0.08/0.37 # Found 6 steps % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X7,implies(X6,X5)),implies(implies(X7,X6),implies(X7,X5))))), inference(start_rule)). % 0.08/0.37 cnf(i_0_10, plain, (a_truth(implies(implies(X7,implies(X6,X5)),implies(implies(X7,X6),implies(X7,X5))))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_19, plain, (a_truth(implies(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 0.08/0.37 cnf(i_0_20, plain, (~a_truth(implies(implies(implies(X7,implies(X6,X5)),implies(implies(X7,X6),implies(X7,X5))),implies(esk1_0,esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_29, plain, (~a_truth(implies(implies(not(implies(esk1_0,esk1_0)),not(implies(implies(X7,implies(X6,X5)),implies(implies(X7,X6),implies(X7,X5))))),implies(implies(implies(X7,implies(X6,X5)),implies(implies(X7,X6),implies(X7,X5))),implies(esk1_0,esk1_0))))), inference(closure_rule, [i_0_2])). % 0.08/0.37 cnf(i_0_30, plain, (~a_truth(implies(not(implies(esk1_0,esk1_0)),not(implies(implies(X7,implies(X6,X5)),implies(implies(X7,X6),implies(X7,X5))))))), inference(etableau_closure_rule, [i_0_30, ...])). % 0.08/0.37 # End printing tableau % 0.08/0.37 # SZS output end % 0.08/0.37 # Branches closed with saturation will be marked with an "s" % 0.08/0.37 # There were 1 total branch saturation attempts. % 0.08/0.37 # There were 0 of these attempts blocked. % 0.08/0.37 # There were 0 deferred branch saturation attempts. % 0.08/0.37 # There were 0 free duplicated saturations. % 0.08/0.37 # There were 1 total successful branch saturations. % 0.08/0.37 # There were 0 successful branch saturations in interreduction. % 0.08/0.37 # There were 0 successful branch saturations on the branch. % 0.08/0.37 # There were 1 successful branch saturations after the branch. % 0.08/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.08/0.37 # Begin clausification derivation % 0.08/0.37 % 0.08/0.37 # End clausification derivation % 0.08/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.08/0.37 cnf(i_0_4, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))). % 0.08/0.37 cnf(i_0_2, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 0.08/0.37 cnf(i_0_3, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). % 0.08/0.37 cnf(i_0_1, negated_conjecture, (~a_truth(implies(esk1_0,esk1_0)))). % 0.08/0.37 cnf(i_0_5, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))). % 0.08/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.08/0.37 # Begin printing tableau % 0.08/0.37 # Found 8 steps % 0.08/0.37 cnf(i_0_5, negated_conjecture, (a_truth(implies(esk1_0,esk1_0))|~a_truth(implies(implies(not(esk1_0),not(esk1_0)),implies(esk1_0,esk1_0)))|~a_truth(implies(not(esk1_0),not(esk1_0)))), inference(start_rule)). % 0.08/0.37 cnf(i_0_6, plain, (a_truth(implies(esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 0.08/0.37 cnf(i_0_7, plain, (~a_truth(implies(implies(not(esk1_0),not(esk1_0)),implies(esk1_0,esk1_0)))), inference(closure_rule, [i_0_2])). % 0.08/0.37 cnf(i_0_8, plain, (~a_truth(implies(not(esk1_0),not(esk1_0)))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_14, plain, (~a_truth(implies(implies(not(not(esk1_0)),not(not(esk1_0))),implies(not(esk1_0),not(esk1_0))))), inference(closure_rule, [i_0_2])). % 0.08/0.37 cnf(i_0_15, plain, (~a_truth(implies(not(not(esk1_0)),not(not(esk1_0))))), inference(extension_rule, [i_0_5])). % 0.08/0.37 cnf(i_0_29, plain, (~a_truth(implies(implies(not(not(not(esk1_0))),not(not(not(esk1_0)))),implies(not(not(esk1_0)),not(not(esk1_0)))))), inference(closure_rule, [i_0_2])). % 0.08/0.37 cnf(i_0_30, plain, (~a_truth(implies(not(not(not(esk1_0))),not(not(not(esk1_0)))))), inference(etableau_closure_rule, [i_0_30, ...])). % 0.08/0.37 # End printing tableau % 0.08/0.37 # SZS output end % 0.08/0.37 # Branches closed with saturation will be marked with an "s" % 0.08/0.37 # Child (3247044) has found a proof. % 0.08/0.37 % 0.08/0.37 # Proof search is over... % 0.08/0.37 # Freeing feature tree %------------------------------------------------------------------------------