TSTP Solution File: LCL683+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL683+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 : n025.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:32 EDT 2022
% Result : CounterSatisfiable 0.19s 0.41s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL683+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.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 18:29:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.12/0.37 # and selection function SelectNewComplexAHP.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 42 Number of unprocessed: 42
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 42 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 40 conjectures.
% 0.12/0.37 # There are 40 start rule candidates:
% 0.12/0.37 # Found 13 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 40 start rule tableaux created.
% 0.12/0.37 # 29 extension rule candidate clauses
% 0.12/0.37 # 13 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.41 # 16015 Satisfiable branch
% 0.19/0.41 # 16016 Satisfiable branch
% 0.19/0.41 # Satisfiable branch found.
% 0.19/0.41 # There were 3 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 2 total successful branch saturations.
% 0.19/0.41 # There were 0 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 2 successful branch saturations after the branch.
% 0.19/0.41 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 # Begin clausification derivation
% 0.19/0.41
% 0.19/0.41 # End clausification derivation
% 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41 cnf(i_0_14, negated_conjecture, (r1(esk1_0,esk14_0))).
% 0.19/0.41 cnf(i_0_11, negated_conjecture, (r1(esk1_0,esk16_0))).
% 0.19/0.41 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk18_0))).
% 0.19/0.41 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk20_0))).
% 0.19/0.41 cnf(i_0_13, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.19/0.41 cnf(i_0_10, negated_conjecture, (r1(esk16_0,esk17_0))).
% 0.19/0.41 cnf(i_0_7, negated_conjecture, (r1(esk18_0,esk19_0))).
% 0.19/0.41 cnf(i_0_4, negated_conjecture, (r1(esk20_0,esk21_0))).
% 0.19/0.41 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.19/0.41 cnf(i_0_12, negated_conjecture, (~p15(esk15_0))).
% 0.19/0.41 cnf(i_0_9, negated_conjecture, (~p13(esk17_0))).
% 0.19/0.41 cnf(i_0_3, negated_conjecture, (~p11(esk21_0))).
% 0.19/0.41 cnf(i_0_6, negated_conjecture, (~p12(esk19_0))).
% 0.19/0.41 cnf(i_0_37, negated_conjecture, (p16(X1)|~p26(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_33, negated_conjecture, (p16(X1)|~p24(esk4_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_29, negated_conjecture, (p16(X1)|~p22(esk6_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_35, negated_conjecture, (p14(X1)|~p26(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_31, negated_conjecture, (p14(X1)|~p24(esk5_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_27, negated_conjecture, (p14(X1)|~p22(esk7_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_25, negated_conjecture, (p15(X1)|~p23(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_23, negated_conjecture, (p15(X1)|~p21(esk9_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_21, negated_conjecture, (p13(X1)|~p23(esk10_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_19, negated_conjecture, (p13(X1)|~p21(esk11_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_17, negated_conjecture, (p11(X1)|~p23(esk12_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_15, negated_conjecture, (p11(X1)|~p21(esk13_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_42, negated_conjecture, (p26(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.19/0.41 cnf(i_0_41, negated_conjecture, (p25(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.19/0.41 cnf(i_0_38, negated_conjecture, (p16(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_40, negated_conjecture, (p24(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.19/0.41 cnf(i_0_39, negated_conjecture, (p22(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.19/0.41 cnf(i_0_34, negated_conjecture, (p16(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_30, negated_conjecture, (p16(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_36, negated_conjecture, (p14(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_32, negated_conjecture, (p14(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_28, negated_conjecture, (p14(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_26, negated_conjecture, (p15(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_24, negated_conjecture, (p15(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_22, negated_conjecture, (p13(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_20, negated_conjecture, (p13(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_18, negated_conjecture, (p11(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_16, negated_conjecture, (p11(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))).
% 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.41 # Begin printing tableau
% 0.19/0.41 # Found 6 steps
% 0.19/0.41 cnf(i_0_16, negated_conjecture, (p11(esk21_0)|r1(esk21_0,esk13_1(esk21_0))|~r1(esk1_0,esk21_0)), inference(start_rule)).
% 0.19/0.41 cnf(i_0_43, plain, (p11(esk21_0)), inference(closure_rule, [i_0_3])).
% 0.19/0.41 cnf(i_0_44, plain, (r1(esk21_0,esk13_1(esk21_0))), inference(extension_rule, [i_0_2])).
% 0.19/0.41 cnf(i_0_139, plain, (r1(esk1_0,esk13_1(esk21_0))), inference(extension_rule, [i_0_16])).
% 0.19/0.41 cnf(i_0_45, plain, (~r1(esk1_0,esk21_0)), inference(etableau_closure_rule, [i_0_45, ...])).
% 0.19/0.41 cnf(i_0_141, plain, (~r1(esk1_0,esk21_0)), inference(etableau_closure_rule, [i_0_141, ...])).
% 0.19/0.41 # End printing tableau
% 0.19/0.41 # SZS output end
% 0.19/0.41 # Branches closed with saturation will be marked with an "s"
% 0.19/0.41 # Satisfiable branch found.
% 0.19/0.41 # There were 3 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 2 total successful branch saturations.
% 0.19/0.41 # There were 0 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 2 successful branch saturations after the branch.
% 0.19/0.41 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 # Begin clausification derivation
% 0.19/0.41
% 0.19/0.41 # End clausification derivation
% 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41 cnf(i_0_14, negated_conjecture, (r1(esk1_0,esk14_0))).
% 0.19/0.41 cnf(i_0_11, negated_conjecture, (r1(esk1_0,esk16_0))).
% 0.19/0.41 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk18_0))).
% 0.19/0.41 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk20_0))).
% 0.19/0.41 cnf(i_0_13, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.19/0.41 cnf(i_0_10, negated_conjecture, (r1(esk16_0,esk17_0))).
% 0.19/0.41 cnf(i_0_7, negated_conjecture, (r1(esk18_0,esk19_0))).
% 0.19/0.41 cnf(i_0_4, negated_conjecture, (r1(esk20_0,esk21_0))).
% 0.19/0.41 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.19/0.41 cnf(i_0_12, negated_conjecture, (~p15(esk15_0))).
% 0.19/0.41 cnf(i_0_9, negated_conjecture, (~p13(esk17_0))).
% 0.19/0.41 cnf(i_0_3, negated_conjecture, (~p11(esk21_0))).
% 0.19/0.41 cnf(i_0_6, negated_conjecture, (~p12(esk19_0))).
% 0.19/0.41 cnf(i_0_37, negated_conjecture, (p16(X1)|~p26(esk2_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_33, negated_conjecture, (p16(X1)|~p24(esk4_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_29, negated_conjecture, (p16(X1)|~p22(esk6_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_35, negated_conjecture, (p14(X1)|~p26(esk3_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_31, negated_conjecture, (p14(X1)|~p24(esk5_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_27, negated_conjecture, (p14(X1)|~p22(esk7_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_25, negated_conjecture, (p15(X1)|~p23(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_23, negated_conjecture, (p15(X1)|~p21(esk9_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_21, negated_conjecture, (p13(X1)|~p23(esk10_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_19, negated_conjecture, (p13(X1)|~p21(esk11_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_17, negated_conjecture, (p11(X1)|~p23(esk12_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_15, negated_conjecture, (p11(X1)|~p21(esk13_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_42, negated_conjecture, (p26(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.19/0.41 cnf(i_0_41, negated_conjecture, (p25(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.19/0.41 cnf(i_0_38, negated_conjecture, (p16(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_40, negated_conjecture, (p24(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.19/0.41 cnf(i_0_39, negated_conjecture, (p22(X1)|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.19/0.41 cnf(i_0_34, negated_conjecture, (p16(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_30, negated_conjecture, (p16(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_36, negated_conjecture, (p14(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_32, negated_conjecture, (p14(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_28, negated_conjecture, (p14(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_26, negated_conjecture, (p15(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_24, negated_conjecture, (p15(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_22, negated_conjecture, (p13(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_20, negated_conjecture, (p13(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_18, negated_conjecture, (p11(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_16, negated_conjecture, (p11(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))).
% 0.19/0.41 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))).
% 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.41 # Begin printing tableau
% 0.19/0.41 # Found 6 steps
% 0.19/0.41 cnf(i_0_18, negated_conjecture, (p11(esk21_0)|r1(esk21_0,esk12_1(esk21_0))|~r1(esk1_0,esk21_0)), inference(start_rule)).
% 0.19/0.41 cnf(i_0_46, plain, (p11(esk21_0)), inference(closure_rule, [i_0_3])).
% 0.19/0.41 cnf(i_0_47, plain, (r1(esk21_0,esk12_1(esk21_0))), inference(extension_rule, [i_0_2])).
% 0.19/0.41 cnf(i_0_139, plain, (r1(esk1_0,esk12_1(esk21_0))), inference(extension_rule, [i_0_16])).
% 0.19/0.41 cnf(i_0_48, plain, (~r1(esk1_0,esk21_0)), inference(etableau_closure_rule, [i_0_48, ...])).
% 0.19/0.41 cnf(i_0_141, plain, (~r1(esk1_0,esk21_0)), inference(etableau_closure_rule, [i_0_141, ...])).
% 0.19/0.41 # End printing tableau
% 0.19/0.41 # SZS output end
% 0.19/0.41 # Branches closed with saturation will be marked with an "s"
% 0.19/0.41 # Child (16015) has found a proof.
% 0.19/0.41
% 0.19/0.41 # Proof search is over...
% 0.19/0.41 # Freeing feature tree
%------------------------------------------------------------------------------