TSTP Solution File: LCL639+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL639+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 : n004.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:23:25 EDT 2022
% Result : CounterSatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL639+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/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.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 02:44:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 26 Number of unprocessed: 26
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 26 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 26 conjectures.
% 0.13/0.37 # There are 26 start rule candidates:
% 0.13/0.37 # Found 4 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 26 start rule tableaux created.
% 0.13/0.37 # 22 extension rule candidate clauses
% 0.13/0.37 # 4 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # 3804 Satisfiable branch
% 0.13/0.38 # 3802 Satisfiable branch
% 0.13/0.38 # Satisfiable branch found.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk12_0))).
% 0.13/0.38 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.13/0.38 cnf(i_0_2, negated_conjecture, (r1(esk12_0,esk14_0))).
% 0.13/0.38 cnf(i_0_1, negated_conjecture, (~p1(esk14_0))).
% 0.13/0.38 cnf(i_0_3, negated_conjecture, (p1(X1)|~r1(esk13_0,X1))).
% 0.13/0.38 cnf(i_0_6, negated_conjecture, (r1(X1,esk11_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_13, negated_conjecture, (p1(esk6_1(X1))|~p1(esk7_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (r1(X1,esk6_1(X1))|~p1(esk7_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(esk10_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (r1(X1,esk7_1(X1))|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_22, negated_conjecture, (p1(X1)|~p1(esk2_3(X2,X3,X1))|~p1(esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (p1(esk6_1(X1))|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_8, negated_conjecture, (p1(X1)|r1(X2,esk10_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_19, negated_conjecture, (p1(X1)|~p1(esk4_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))).
% 0.13/0.38 cnf(i_0_23, negated_conjecture, (p1(X1)|r1(X2,esk3_1(X2))|~p1(esk2_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_21, negated_conjecture, (p1(X1)|p1(X2)|~p1(esk2_3(X3,X4,X2))|~r1(esk3_1(X3),X1)|~r1(esk1_0,X3)|~r1(X4,X2)|~r1(X3,X4))).
% 0.13/0.38 cnf(i_0_17, negated_conjecture, (p1(esk5_1(X1))|p1(X2)|~p1(X3)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X4,X2)|~r1(X1,X4))).
% 0.13/0.38 cnf(i_0_10, negated_conjecture, (p1(esk8_3(X1,X2,X3))|r1(X1,esk9_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.13/0.38 cnf(i_0_9, negated_conjecture, (p1(esk8_3(X1,X2,X3))|~p1(X4)|~r1(esk9_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.13/0.38 cnf(i_0_25, negated_conjecture, (p1(X1)|r1(X1,esk2_3(X2,X3,X1))|~p1(esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_11, negated_conjecture, (r1(X1,esk8_3(X2,X3,X1))|~p1(X4)|~r1(esk9_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_20, negated_conjecture, (p1(X1)|r1(X2,esk4_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))).
% 0.13/0.38 cnf(i_0_12, negated_conjecture, (r1(X1,esk8_3(X2,X3,X1))|r1(X2,esk9_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_18, negated_conjecture, (p1(X1)|r1(esk4_1(X2),esk5_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (p1(X1)|r1(X1,esk2_3(X2,X3,X1))|r1(X2,esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_24, negated_conjecture, (p1(X1)|p1(X2)|r1(X2,esk2_3(X3,X4,X2))|~r1(esk3_1(X3),X1)|~r1(esk1_0,X3)|~r1(X4,X2)|~r1(X3,X4))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 12 steps
% 0.13/0.38 cnf(i_0_12, negated_conjecture, (r1(esk14_0,esk8_3(esk12_0,esk12_0,esk14_0))|r1(esk12_0,esk9_1(esk12_0))|~r1(esk1_0,esk12_0)|~r1(esk12_0,esk14_0)|~r1(esk12_0,esk12_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_49, plain, (~r1(esk1_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.13/0.38 cnf(i_0_50, plain, (~r1(esk12_0,esk14_0)), inference(closure_rule, [i_0_2])).
% 0.13/0.38 cnf(i_0_47, plain, (r1(esk14_0,esk8_3(esk12_0,esk12_0,esk14_0))), inference(extension_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_145, plain, (p1(esk14_0)), inference(closure_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_149, plain, (~r1(esk1_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.13/0.38 cnf(i_0_151, plain, (~r1(esk12_0,esk14_0)), inference(closure_rule, [i_0_2])).
% 0.13/0.38 cnf(i_0_146, plain, (p1(esk8_3(esk12_0,esk12_0,esk14_0))), inference(extension_rule, [i_0_18])).
% 0.13/0.38 cnf(i_0_158, plain, (p1(esk14_0)), inference(closure_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_161, plain, (~r1(esk1_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.13/0.38 cnf(i_0_162, plain, (~r1(esk14_0,esk8_3(esk12_0,esk12_0,esk14_0))), inference(closure_rule, [i_0_47])).
% 0.13/0.38 cnf(i_0_163, plain, (~r1(esk12_0,esk14_0)), inference(closure_rule, [i_0_2])).
% 0.13/0.38 # 3807 Satisfiable branch
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Satisfiable branch found.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk12_0))).
% 0.13/0.38 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.13/0.38 cnf(i_0_2, negated_conjecture, (r1(esk12_0,esk14_0))).
% 0.13/0.38 cnf(i_0_1, negated_conjecture, (~p1(esk14_0))).
% 0.13/0.38 cnf(i_0_3, negated_conjecture, (p1(X1)|~r1(esk13_0,X1))).
% 0.13/0.38 cnf(i_0_6, negated_conjecture, (r1(X1,esk11_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_13, negated_conjecture, (p1(esk6_1(X1))|~p1(esk7_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (r1(X1,esk6_1(X1))|~p1(esk7_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(esk10_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (r1(X1,esk7_1(X1))|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_22, negated_conjecture, (p1(X1)|~p1(esk2_3(X2,X3,X1))|~p1(esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (p1(esk6_1(X1))|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))).
% 0.13/0.38 cnf(i_0_8, negated_conjecture, (p1(X1)|r1(X2,esk10_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_19, negated_conjecture, (p1(X1)|~p1(esk4_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))).
% 0.13/0.38 cnf(i_0_23, negated_conjecture, (p1(X1)|r1(X2,esk3_1(X2))|~p1(esk2_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_21, negated_conjecture, (p1(X1)|p1(X2)|~p1(esk2_3(X3,X4,X2))|~r1(esk3_1(X3),X1)|~r1(esk1_0,X3)|~r1(X4,X2)|~r1(X3,X4))).
% 0.13/0.38 cnf(i_0_17, negated_conjecture, (p1(esk5_1(X1))|p1(X2)|~p1(X3)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X4,X2)|~r1(X1,X4))).
% 0.13/0.38 cnf(i_0_10, negated_conjecture, (p1(esk8_3(X1,X2,X3))|r1(X1,esk9_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.13/0.38 cnf(i_0_9, negated_conjecture, (p1(esk8_3(X1,X2,X3))|~p1(X4)|~r1(esk9_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.13/0.38 cnf(i_0_25, negated_conjecture, (p1(X1)|r1(X1,esk2_3(X2,X3,X1))|~p1(esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_11, negated_conjecture, (r1(X1,esk8_3(X2,X3,X1))|~p1(X4)|~r1(esk9_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_20, negated_conjecture, (p1(X1)|r1(X2,esk4_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))).
% 0.13/0.38 cnf(i_0_12, negated_conjecture, (r1(X1,esk8_3(X2,X3,X1))|r1(X2,esk9_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_18, negated_conjecture, (p1(X1)|r1(esk4_1(X2),esk5_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))).
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (p1(X1)|r1(X1,esk2_3(X2,X3,X1))|r1(X2,esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.13/0.38 cnf(i_0_24, negated_conjecture, (p1(X1)|p1(X2)|r1(X2,esk2_3(X3,X4,X2))|~r1(esk3_1(X3),X1)|~r1(esk1_0,X3)|~r1(X4,X2)|~r1(X3,X4))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 13 steps
% 0.13/0.38 cnf(i_0_26, negated_conjecture, (p1(esk14_0)|r1(esk14_0,esk2_3(esk12_0,esk12_0,esk14_0))|r1(esk12_0,esk3_1(esk12_0))|~r1(esk1_0,esk12_0)|~r1(esk12_0,esk14_0)|~r1(esk12_0,esk12_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_34, plain, (p1(esk14_0)), inference(closure_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_37, plain, (~r1(esk1_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.13/0.38 cnf(i_0_38, plain, (~r1(esk12_0,esk14_0)), inference(closure_rule, [i_0_2])).
% 0.13/0.38 cnf(i_0_35, plain, (r1(esk14_0,esk2_3(esk12_0,esk12_0,esk14_0))), inference(extension_rule, [i_0_24])).
% 0.13/0.38 cnf(i_0_145, plain, (p1(esk14_0)), inference(closure_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_149, plain, (~r1(esk1_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.13/0.38 cnf(i_0_151, plain, (~r1(esk12_0,esk14_0)), inference(closure_rule, [i_0_2])).
% 0.13/0.38 cnf(i_0_146, plain, (p1(esk2_3(esk12_0,esk12_0,esk14_0))), inference(extension_rule, [i_0_18])).
% 0.13/0.38 cnf(i_0_158, plain, (p1(esk14_0)), inference(closure_rule, [i_0_1])).
% 0.13/0.38 cnf(i_0_161, plain, (~r1(esk1_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.13/0.38 cnf(i_0_162, plain, (~r1(esk14_0,esk2_3(esk12_0,esk12_0,esk14_0))), inference(closure_rule, [i_0_35]))# Satisfiable branch found.
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 .
% 0.13/0.38 cnf(i_0_163, plain, (~r1(esk12_0,esk14_0)), inference(closure_rule, [i_0_2])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Child (3804) has found a proof.
% 0.13/0.38
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------