TSTP Solution File: LCL658+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL658+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 : n019.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:57 EDT 2022
% Result : Theorem 176.85s 22.61s
% Output : CNFRefutation 176.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL658+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.00/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.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 16:01:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 59 Number of unprocessed: 59
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 59 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 10 conjectures.
% 0.19/0.37 # There are 10 start rule candidates:
% 0.19/0.37 # Found 5 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 10 start rule tableaux created.
% 0.19/0.37 # 54 extension rule candidate clauses
% 0.19/0.37 # 5 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 21.39/3.06 # Ran out of tableaux, making start rules for all clauses
% 176.85/22.61 # There were 10 total branch saturation attempts.
% 176.85/22.61 # There were 0 of these attempts blocked.
% 176.85/22.61 # There were 0 deferred branch saturation attempts.
% 176.85/22.61 # There were 0 free duplicated saturations.
% 176.85/22.61 # There were 5 total successful branch saturations.
% 176.85/22.61 # There were 0 successful branch saturations in interreduction.
% 176.85/22.61 # There were 0 successful branch saturations on the branch.
% 176.85/22.61 # There were 5 successful branch saturations after the branch.
% 176.85/22.61 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 176.85/22.61 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 176.85/22.61 # Begin clausification derivation
% 176.85/22.61
% 176.85/22.61 # End clausification derivation
% 176.85/22.61 # Begin listing active clauses obtained from FOF to CNF conversion
% 176.85/22.61 cnf(i_0_10, negated_conjecture, (r1(esk1_0,esk2_0))).
% 176.85/22.61 cnf(i_0_9, negated_conjecture, (r1(esk2_0,esk3_0))).
% 176.85/22.61 cnf(i_0_7, negated_conjecture, (r1(esk2_0,esk4_0))).
% 176.85/22.61 cnf(i_0_1, plain, (r1(X1,X1))).
% 176.85/22.61 cnf(i_0_8, negated_conjecture, (~p1(esk3_0))).
% 176.85/22.61 cnf(i_0_6, negated_conjecture, (p1(X1)|~r1(esk4_0,X1))).
% 176.85/22.61 cnf(i_0_11, negated_conjecture, (epred1_1(X1)|~r1(esk1_0,X1))).
% 176.85/22.61 cnf(i_0_3, negated_conjecture, (p1(X1)|~p1(esk6_1(X1))|~r1(esk2_0,X1))).
% 176.85/22.61 cnf(i_0_2, negated_conjecture, (p1(esk5_1(X1))|p1(X1)|~r1(esk2_0,X1))).
% 176.85/22.61 cnf(i_0_27, plain, (p1(X1)|~epred1_1(X1)|~p1(esk12_2(X1,X2))|~p1(esk13_1(X1))|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_5, negated_conjecture, (p1(X1)|r1(X1,esk5_1(X1))|~r1(esk2_0,X1))).
% 176.85/22.61 cnf(i_0_4, negated_conjecture, (p1(X1)|r1(esk5_1(X1),esk6_1(X1))|~r1(esk2_0,X1))).
% 176.85/22.61 cnf(i_0_16, plain, (p1(X1)|~epred1_1(X2)|~p1(esk16_3(X2,X3,X1))|~p1(esk17_1(X2))|~r1(X3,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_30, plain, (p1(X1)|r1(X2,esk12_2(X1,X2))|~epred1_1(X1)|~p1(esk13_1(X1))|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_28, plain, (p1(X1)|r1(X1,esk13_1(X1))|~epred1_1(X1)|~p1(esk12_2(X1,X2))|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_24, plain, (p1(X1)|~epred1_1(X2)|~p1(esk14_2(X2,X3))|~r1(X4,X1)|~r1(X3,X4)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_31, plain, (p1(X1)|r1(X2,esk12_2(X1,X2))|r1(X1,esk13_1(X1))|~epred1_1(X1)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_13, plain, (p1(esk15_3(X1,X2,X3))|p1(X3)|~epred1_1(X1)|~p1(esk17_1(X1))|~r1(X2,X3)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_43, plain, (p1(X1)|~epred1_1(X2)|~p1(esk8_2(X2,X3))|~p1(esk10_1(X2))|~p1(X2)|~r1(X2,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_42, plain, (p1(esk9_1(X1))|p1(X2)|~epred1_1(X1)|~p1(esk8_2(X1,X3))|~p1(X1)|~r1(X1,X2)|~r1(X1,X3))).
% 176.85/22.61 cnf(i_0_17, plain, (p1(X1)|r1(X2,esk17_1(X2))|~epred1_1(X2)|~p1(esk16_3(X2,X3,X1))|~r1(X3,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_22, plain, (p1(X1)|r1(X1,esk15_3(X2,X3,X1))|~epred1_1(X2)|~p1(esk17_1(X2))|~r1(X3,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_35, plain, (p1(esk7_2(X1,X2))|p1(esk9_1(X1))|p1(X3)|~epred1_1(X1)|~p1(X1)|~r1(X1,X3)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_36, plain, (p1(esk7_2(X1,X2))|p1(X3)|~epred1_1(X1)|~p1(esk10_1(X1))|~p1(X1)|~r1(X1,X3)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_26, plain, (p1(X1)|p1(X2)|~epred1_1(X1)|~p1(esk12_2(X1,X3))|~p1(X4)|~r1(esk13_1(X1),X4)|~r1(X4,X2)|~r1(X1,X3))).
% 176.85/22.61 cnf(i_0_25, plain, (p1(X1)|r1(X2,esk14_2(X3,X2))|~epred1_1(X3)|~r1(X4,X1)|~r1(X3,X2)|~r1(X2,X4))).
% 176.85/22.61 cnf(i_0_45, plain, (p1(X1)|r1(X2,esk9_1(X2))|~epred1_1(X2)|~p1(esk8_2(X2,X3))|~p1(X2)|~r1(X2,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_56, plain, (p1(esk9_1(X1))|p1(X2)|r1(X3,esk7_2(X1,X3))|~epred1_1(X1)|~p1(X1)|~r1(X1,X2)|~r1(X1,X3))).
% 176.85/22.61 cnf(i_0_14, plain, (p1(esk15_3(X1,X2,X3))|p1(X3)|r1(X1,esk17_1(X1))|~epred1_1(X1)|~r1(X2,X3)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_57, plain, (p1(X1)|r1(X2,esk7_2(X3,X2))|~epred1_1(X3)|~p1(esk10_1(X3))|~p1(X3)|~r1(X3,X1)|~r1(X3,X2))).
% 176.85/22.61 cnf(i_0_15, plain, (p1(X1)|p1(X2)|~epred1_1(X3)|~p1(esk16_3(X3,X4,X2))|~p1(X5)|~r1(esk17_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))).
% 176.85/22.61 cnf(i_0_44, plain, (p1(X1)|r1(esk9_1(X2),esk10_1(X2))|~epred1_1(X2)|~p1(esk8_2(X2,X3))|~p1(X2)|~r1(X2,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_19, plain, (p1(X1)|r1(esk15_3(X2,X3,X1),esk16_3(X2,X3,X1))|~epred1_1(X2)|~p1(esk17_1(X2))|~r1(X3,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_23, plain, (p1(X1)|r1(X1,esk15_3(X2,X3,X1))|r1(X2,esk17_1(X2))|~epred1_1(X2)|~r1(X3,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_38, plain, (p1(esk7_2(X1,X2))|p1(X3)|r1(X1,esk9_1(X1))|~epred1_1(X1)|~p1(X1)|~r1(X1,X3)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_29, plain, (p1(X1)|p1(X2)|r1(X3,esk12_2(X1,X3))|~epred1_1(X1)|~p1(X4)|~r1(esk13_1(X1),X4)|~r1(X4,X2)|~r1(X1,X3))).
% 176.85/22.61 cnf(i_0_50, plain, (p1(X1)|r1(esk7_2(X2,X3),esk8_2(X2,X3))|~epred1_1(X2)|~p1(esk10_1(X2))|~p1(X2)|~r1(X2,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_37, plain, (p1(esk7_2(X1,X2))|p1(X3)|r1(esk9_1(X1),esk10_1(X1))|~epred1_1(X1)|~p1(X1)|~r1(X1,X3)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_59, plain, (p1(X1)|r1(X2,esk7_2(X3,X2))|r1(X3,esk9_1(X3))|~epred1_1(X3)|~p1(X3)|~r1(X3,X1)|~r1(X3,X2))).
% 176.85/22.61 cnf(i_0_20, plain, (p1(X1)|r1(esk15_3(X2,X3,X1),esk16_3(X2,X3,X1))|r1(X2,esk17_1(X2))|~epred1_1(X2)|~r1(X3,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_49, plain, (p1(esk9_1(X1))|p1(X2)|r1(esk7_2(X1,X3),esk8_2(X1,X3))|~epred1_1(X1)|~p1(X1)|~r1(X1,X2)|~r1(X1,X3))).
% 176.85/22.61 cnf(i_0_12, plain, (p1(esk15_3(X1,X2,X3))|p1(X4)|p1(X3)|~epred1_1(X1)|~p1(X5)|~r1(esk17_1(X1),X5)|~r1(X2,X3)|~r1(X5,X4)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_52, plain, (p1(X1)|r1(esk7_2(X2,X3),esk8_2(X2,X3))|r1(X2,esk9_1(X2))|~epred1_1(X2)|~p1(X2)|~r1(X2,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_21, plain, (p1(X1)|p1(X2)|r1(X2,esk15_3(X3,X4,X2))|~epred1_1(X3)|~p1(X5)|~r1(esk17_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))).
% 176.85/22.61 cnf(i_0_58, plain, (p1(X1)|r1(esk9_1(X2),esk10_1(X2))|r1(X3,esk7_2(X2,X3))|~epred1_1(X2)|~p1(X2)|~r1(X2,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_51, plain, (p1(X1)|r1(esk7_2(X2,X3),esk8_2(X2,X3))|r1(esk9_1(X2),esk10_1(X2))|~epred1_1(X2)|~p1(X2)|~r1(X2,X1)|~r1(X2,X3))).
% 176.85/22.61 cnf(i_0_39, plain, (p1(X1)|p1(X2)|p1(X3)|~epred1_1(X4)|~p1(esk8_2(X4,X5))|~p1(X6)|~p1(X4)|~r1(esk9_1(X4),X1)|~r1(X6,X2)|~r1(X4,X3)|~r1(X4,X5)|~r1(X1,X6))).
% 176.85/22.61 cnf(i_0_40, plain, (p1(X1)|p1(X2)|~epred1_1(X3)|~p1(esk8_2(X3,X4))|~p1(esk11_2(X3,X5))|~p1(X6)|~p1(X3)|~r1(esk9_1(X3),X5)|~r1(X6,X1)|~r1(X5,X6)|~r1(X3,X2)|~r1(X3,X4))).
% 176.85/22.61 cnf(i_0_32, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|p1(X5)|~epred1_1(X1)|~p1(X6)|~p1(X1)|~r1(esk9_1(X1),X3)|~r1(X6,X4)|~r1(X1,X5)|~r1(X1,X2)|~r1(X3,X6))).
% 176.85/22.61 cnf(i_0_53, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk7_2(X5,X4))|~epred1_1(X5)|~p1(X6)|~p1(X5)|~r1(esk9_1(X5),X1)|~r1(X6,X2)|~r1(X5,X3)|~r1(X5,X4)|~r1(X1,X6))).
% 176.85/22.61 cnf(i_0_18, plain, (p1(X1)|p1(X2)|r1(esk15_3(X3,X4,X2),esk16_3(X3,X4,X2))|~epred1_1(X3)|~p1(X5)|~r1(esk17_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))).
% 176.85/22.61 cnf(i_0_33, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|~epred1_1(X1)|~p1(esk11_2(X1,X5))|~p1(X6)|~p1(X1)|~r1(esk9_1(X1),X5)|~r1(X6,X3)|~r1(X5,X6)|~r1(X1,X4)|~r1(X1,X2))).
% 176.85/22.61 cnf(i_0_54, plain, (p1(X1)|p1(X2)|r1(X3,esk7_2(X4,X3))|~epred1_1(X4)|~p1(esk11_2(X4,X5))|~p1(X6)|~p1(X4)|~r1(esk9_1(X4),X5)|~r1(X6,X1)|~r1(X5,X6)|~r1(X4,X2)|~r1(X4,X3))).
% 176.85/22.61 cnf(i_0_41, plain, (p1(X1)|p1(X2)|r1(X3,esk11_2(X4,X3))|~epred1_1(X4)|~p1(esk8_2(X4,X5))|~p1(X6)|~p1(X4)|~r1(esk9_1(X4),X3)|~r1(X6,X1)|~r1(X4,X2)|~r1(X4,X5)|~r1(X3,X6))).
% 176.85/22.61 cnf(i_0_46, plain, (p1(X1)|p1(X2)|p1(X3)|r1(esk7_2(X4,X5),esk8_2(X4,X5))|~epred1_1(X4)|~p1(X6)|~p1(X4)|~r1(esk9_1(X4),X1)|~r1(X6,X2)|~r1(X4,X3)|~r1(X4,X5)|~r1(X1,X6))).
% 176.85/22.61 cnf(i_0_34, plain, (p1(esk7_2(X1,X2))|p1(X3)|p1(X4)|r1(X5,esk11_2(X1,X5))|~epred1_1(X1)|~p1(X6)|~p1(X1)|~r1(esk9_1(X1),X5)|~r1(X6,X3)|~r1(X1,X4)|~r1(X1,X2)|~r1(X5,X6))).
% 176.85/22.61 cnf(i_0_47, plain, (p1(X1)|p1(X2)|r1(esk7_2(X3,X4),esk8_2(X3,X4))|~epred1_1(X3)|~p1(esk11_2(X3,X5))|~p1(X6)|~p1(X3)|~r1(esk9_1(X3),X5)|~r1(X6,X1)|~r1(X5,X6)|~r1(X3,X2)|~r1(X3,X4))).
% 176.85/22.61 cnf(i_0_55, plain, (p1(X1)|p1(X2)|r1(X3,esk11_2(X4,X3))|r1(X5,esk7_2(X4,X5))|~epred1_1(X4)|~p1(X6)|~p1(X4)|~r1(esk9_1(X4),X3)|~r1(X6,X1)|~r1(X4,X2)|~r1(X4,X5)|~r1(X3,X6))).
% 176.85/22.61 cnf(i_0_48, plain, (p1(X1)|p1(X2)|r1(esk7_2(X3,X4),esk8_2(X3,X4))|r1(X5,esk11_2(X3,X5))|~epred1_1(X3)|~p1(X6)|~p1(X3)|~r1(esk9_1(X3),X5)|~r1(X6,X1)|~r1(X3,X2)|~r1(X3,X4)|~r1(X5,X6))).
% 176.85/22.61 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 176.85/22.61 # Begin printing tableau
% 176.85/22.61 # Found 13 steps
% 176.85/22.61 cnf(i_0_10, negated_conjecture, (r1(esk1_0,esk2_0)), inference(start_rule)).
% 176.85/22.61 cnf(i_0_79, plain, (r1(esk1_0,esk2_0)), inference(extension_rule, [i_0_11])).
% 176.85/22.61 cnf(i_0_310949, plain, (epred1_1(esk2_0)), inference(extension_rule, [i_0_19])).
% 176.85/22.61 cnf(i_0_310951, plain, (p1(esk3_0)), inference(closure_rule, [i_0_8])).
% 176.85/22.61 cnf(i_0_310955, plain, (~r1(esk3_0,esk3_0)), inference(closure_rule, [i_0_1])).
% 176.85/22.61 cnf(i_0_310956, plain, (~r1(esk2_0,esk3_0)), inference(closure_rule, [i_0_9])).
% 176.85/22.61 cnf(i_0_310952, plain, (r1(esk15_3(esk2_0,esk3_0,esk3_0),esk16_3(esk2_0,esk3_0,esk3_0))), inference(extension_rule, [i_0_23])).
% 176.85/22.61 cnf(i_0_344003, plain, (~epred1_1(esk2_0)), inference(closure_rule, [i_0_310949])).
% 176.85/22.61 cnf(i_0_310954, plain, (~p1(esk17_1(esk2_0))), inference(etableau_closure_rule, [i_0_310954, ...])).
% 176.85/22.61 cnf(i_0_344000, plain, (p1(esk16_3(esk2_0,esk3_0,esk3_0))), inference(etableau_closure_rule, [i_0_344000, ...])).
% 176.85/22.61 cnf(i_0_344001, plain, (r1(esk16_3(esk2_0,esk3_0,esk3_0),esk15_3(esk2_0,esk15_3(esk2_0,esk3_0,esk3_0),esk16_3(esk2_0,esk3_0,esk3_0)))), inference(etableau_closure_rule, [i_0_344001, ...])).
% 176.85/22.61 cnf(i_0_344002, plain, (r1(esk2_0,esk17_1(esk2_0))), inference(etableau_closure_rule, [i_0_344002, ...])).
% 176.85/22.61 cnf(i_0_344005, plain, (~r1(esk2_0,esk15_3(esk2_0,esk3_0,esk3_0))), inference(etableau_closure_rule, [i_0_344005, ...])).
% 176.85/22.61 # End printing tableau
% 176.85/22.61 # SZS output end
% 176.85/22.61 # Branches closed with saturation will be marked with an "s"
% 176.85/22.62 # Child (9349) has found a proof.
% 176.85/22.62
% 176.85/22.62 # Proof search is over...
% 176.85/22.62 # Freeing feature tree
%------------------------------------------------------------------------------