TSTP Solution File: LCL678+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL678+1.001 : TPTP v8.1.0. Released v4.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 : n011.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 : Sun Jul 17 10:24:25 EDT 2022
% Result : Theorem 0.11s 0.34s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL678+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jul 3 06:56:35 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 # No SInE strategy applied
% 0.11/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.34 #
% 0.11/0.34 # Presaturation interreduction done
% 0.11/0.34 # Number of axioms: 6 Number of unprocessed: 6
% 0.11/0.34 # Tableaux proof search.
% 0.11/0.34 # APR header successfully linked.
% 0.11/0.34 # Hello from C++
% 0.11/0.34 # The folding up rule is enabled...
% 0.11/0.34 # Local unification is enabled...
% 0.11/0.34 # Any saturation attempts will use folding labels...
% 0.11/0.34 # 6 beginning clauses after preprocessing and clausification
% 0.11/0.34 # Creating start rules for all 4 conjectures.
% 0.11/0.34 # There are 4 start rule candidates:
% 0.11/0.34 # Found 1 unit axioms.
% 0.11/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.34 # 4 start rule tableaux created.
% 0.11/0.34 # 5 extension rule candidate clauses
% 0.11/0.34 # 1 unit axiom clauses
% 0.11/0.34
% 0.11/0.34 # Requested 8, 32 cores available to the main process.
% 0.11/0.34 # There are not enough tableaux to fork, creating more from the initial 4
% 0.11/0.34 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.34 # We now have 9 tableaux to operate on
% 0.11/0.34 # There were 1 total branch saturation attempts.
% 0.11/0.34 # There were 0 of these attempts blocked.
% 0.11/0.34 # There were 0 deferred branch saturation attempts.
% 0.11/0.34 # There were 0 free duplicated saturations.
% 0.11/0.34 # There were 1 total successful branch saturations.
% 0.11/0.34 # There were 1 successful branch saturations in interreduction.
% 0.11/0.34 # There were 0 successful branch saturations on the branch.
% 0.11/0.34 # There were 0 successful branch saturations after the branch.
% 0.11/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 # Begin clausification derivation
% 0.11/0.34
% 0.11/0.34 # End clausification derivation
% 0.11/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.34 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.11/0.34 cnf(i_0_4, negated_conjecture, (~p1(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_6, negated_conjecture, (r1(X1,esk2_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_3, negated_conjecture, (p1(X1)|~r1(esk2_1(X2),X1)|~r1(esk1_0,X2))).
% 0.11/0.34 cnf(i_0_5, negated_conjecture, (r1(esk2_1(X1),esk3_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))).
% 0.11/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.34 # Begin printing tableau
% 0.11/0.34 # Found 8 steps
% 0.11/0.34 cnf(i_0_4, negated_conjecture, (~p1(esk3_1(esk1_0))|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.11/0.34 cnf(i_0_15, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_14, plain, (~p1(esk3_1(esk1_0))), inference(extension_rule, [i_0_3])).
% 0.11/0.34 cnf(i_0_59, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_58, plain, (~r1(esk2_1(esk1_0),esk3_1(esk1_0))), inference(extension_rule, [i_0_2])).
% 0.11/0.34 cnf(i_0_61, plain, (~r1(esk2_1(esk1_0),esk3_1(esk1_0))), inference(extension_rule, [i_0_5])).
% 0.11/0.34 cnf(i_0_64, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_62, plain, (~r1(esk2_1(esk1_0),esk2_1(esk1_0))), inference(etableau_closure_rule, [i_0_62, ...])).
% 0.11/0.34 # End printing tableau
% 0.11/0.34 # SZS output end
% 0.11/0.34 # Branches closed with saturation will be marked with an "s"
% 0.11/0.34 # Ran out of tableaux, making start rules for all clauses
% 0.11/0.34 # There were 2 total branch saturation attempts.
% 0.11/0.34 # There were 0 of these attempts blocked.
% 0.11/0.34 # There were 0 deferred branch saturation attempts.
% 0.11/0.34 # There were 0 free duplicated saturations.
% 0.11/0.34 # There were 2 total successful branch saturations.
% 0.11/0.34 # There were 1 successful branch saturations in interreduction.
% 0.11/0.34 # There were 0 successful branch saturations on the branch.
% 0.11/0.34 # There were 1 successful branch saturations after the branch.
% 0.11/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 # Begin clausification derivation
% 0.11/0.34
% 0.11/0.34 # End clausification derivation
% 0.11/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.34 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.11/0.34 cnf(i_0_4, negated_conjecture, (~p1(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_6, negated_conjecture, (r1(X1,esk2_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_3, negated_conjecture, (p1(X1)|~r1(esk2_1(X2),X1)|~r1(esk1_0,X2))).
% 0.11/0.34 cnf(i_0_5, negated_conjecture, (r1(esk2_1(X1),esk3_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))).
% 0.11/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.34 # Begin printing tableau
% 0.11/0.34 # Found 8 steps
% 0.11/0.34 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk2_1(esk1_0))|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.11/0.34 cnf(i_0_13, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_12, plain, (r1(esk1_0,esk2_1(esk1_0))), inference(extension_rule, [i_0_2])).
% 0.11/0.34 cnf(i_0_40, plain, (r1(esk1_0,esk2_1(esk1_0))), inference(extension_rule, [i_0_2])).
% 0.11/0.34 cnf(i_0_41, plain, (~r1(esk2_1(esk1_0),esk2_1(esk1_0))), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_52, plain, (r1(esk1_0,esk2_1(esk1_0))), inference(extension_rule, [i_0_5])).
% 0.11/0.34 cnf(i_0_54, plain, (~r1(esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_54, ...])).
% 0.11/0.34 cnf(i_0_55, plain, (r1(esk2_1(esk2_1(esk1_0)),esk3_1(esk2_1(esk1_0)))), inference(etableau_closure_rule, [i_0_55, ...])).
% 0.11/0.34 # End printing tableau
% 0.11/0.34 # SZS output end
% 0.11/0.34 # Branches closed with saturation will be marked with an "s"
% 0.11/0.34 # There were 2 total branch saturation attempts.
% 0.11/0.34 # There were 0 of these attempts blocked.
% 0.11/0.34 # There were 0 deferred branch saturation attempts.
% 0.11/0.34 # There were 0 free duplicated saturations.
% 0.11/0.34 # There were 2 total successful branch saturations.
% 0.11/0.34 # There were 0 successful branch saturations in interreduction.
% 0.11/0.34 # There were 0 successful branch saturations on the branch.
% 0.11/0.34 # There were 2 successful branch saturations after the branch.
% 0.11/0.34 # There were 1 total branch saturation attempts.
% 0.11/0.34 # There were 0 of these attempts blocked.
% 0.11/0.34 # There were 0 deferred branch saturation attempts.
% 0.11/0.34 # There were 0 free duplicated saturations.
% 0.11/0.34 # There were 1 total successful branch saturations.
% 0.11/0.34 # There were 0 successful branch saturations in interreduction.
% 0.11/0.34 # There were 0 successful branch saturations on the branch.
% 0.11/0.34 # There were 1 successful branch saturations after the branch.
% 0.11/0.34 # Child (3247) has found a proof.
% 0.11/0.34
% 0.11/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 # Begin clausification derivation
% 0.11/0.34
% 0.11/0.34 # End clausification derivation
% 0.11/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.34 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.11/0.34 cnf(i_0_4, negated_conjecture, (~p1(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_6, negated_conjecture, (r1(X1,esk2_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_3, negated_conjecture, (p1(X1)|~r1(esk2_1(X2),X1)|~r1(esk1_0,X2))).
% 0.11/0.34 cnf(i_0_5, negated_conjecture, (r1(esk2_1(X1),esk3_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))).
% 0.11/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.34 # Begin printing tableau
% 0.11/0.34 # Found 6 steps
% 0.11/0.34 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk2_1(esk1_0))|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.11/0.34 cnf(i_0_13, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_12, plain, (r1(esk1_0,esk2_1(esk1_0))), inference(extension_rule, [i_0_4])).
% 0.11/0.34 cnf(i_0_50, plain, (~p1(esk3_1(esk2_1(esk1_0)))), inference(extension_rule, [i_0_3])).
% 0.11/0.34 cnf(i_0_59, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_58, plain, (~r1(esk2_1(esk1_0),esk3_1(esk2_1(esk1_0)))), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.11/0.34 # End printing tableau
% 0.11/0.34 # SZS output end
% 0.11/0.34 # Branches closed with saturation will be marked with an "s"
% 0.11/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 # Begin clausification derivation
% 0.11/0.34
% 0.11/0.34 # End clausification derivation
% 0.11/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.34 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.11/0.34 cnf(i_0_4, negated_conjecture, (~p1(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_6, negated_conjecture, (r1(X1,esk2_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_3, negated_conjecture, (p1(X1)|~r1(esk2_1(X2),X1)|~r1(esk1_0,X2))).
% 0.11/0.34 cnf(i_0_5, negated_conjecture, (r1(esk2_1(X1),esk3_1(X1))|~r1(esk1_0,X1))).
% 0.11/0.34 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))).
% 0.11/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.34 # Begin printing tableau
% 0.11/0.34 # Found 8 steps
% 0.11/0.34 cnf(i_0_5, negated_conjecture, (r1(esk2_1(esk1_0),esk3_1(esk1_0))|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.11/0.34 cnf(i_0_8, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_7, plain, (r1(esk2_1(esk1_0),esk3_1(esk1_0))), inference(extension_rule, [i_0_2])).
% 0.11/0.34 cnf(i_0_16, plain, (r1(esk2_1(esk1_0),esk3_1(esk1_0))), inference(extension_rule, [i_0_2])).
% 0.11/0.34 cnf(i_0_17, plain, (~r1(esk3_1(esk1_0),esk3_1(esk1_0))), inference(closure_rule, [i_0_1])).
% 0.11/0.34 cnf(i_0_52, plain, (r1(esk1_0,esk3_1(esk1_0))), inference(extension_rule, [i_0_5])).
% 0.11/0.34 cnf(i_0_54, plain, (~r1(esk1_0,esk2_1(esk1_0))), inference(etableau_closure_rule, [i_0_54, ...])).
% 0.11/0.34 cnf(i_0_55, plain, (r1(esk2_1(esk3_1(esk1_0)),esk3_1(esk3_1(esk1_0)))), inference(etableau_closure_rule, [i_0_55, ...])).
% 0.11/0.34 # End printing tableau
% 0.11/0.34 # SZS output end
% 0.11/0.34 # Branches closed with saturation will be marked with an "s"
% 0.11/0.34 # Proof search is over...
% 0.11/0.34 # Freeing feature tree
%------------------------------------------------------------------------------