TSTP Solution File: LCL686+1.005 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL686+1.005 : 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 : n018.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:37 EDT 2022
% Result : Theorem 0.10s 0.29s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL686+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.07/0.26 % Computer : n018.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Mon Jul 4 10:43:20 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.10/0.27 # No SInE strategy applied
% 0.10/0.27 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.27 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.10/0.27 #
% 0.10/0.27 # Presaturation interreduction done
% 0.10/0.27 # Number of axioms: 76 Number of unprocessed: 76
% 0.10/0.27 # Tableaux proof search.
% 0.10/0.27 # APR header successfully linked.
% 0.10/0.27 # Hello from C++
% 0.10/0.28 # The folding up rule is enabled...
% 0.10/0.28 # Local unification is enabled...
% 0.10/0.28 # Any saturation attempts will use folding labels...
% 0.10/0.28 # 76 beginning clauses after preprocessing and clausification
% 0.10/0.28 # Creating start rules for all 6 conjectures.
% 0.10/0.28 # There are 6 start rule candidates:
% 0.10/0.28 # Found 6 unit axioms.
% 0.10/0.28 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.10/0.28 # 6 start rule tableaux created.
% 0.10/0.28 # 70 extension rule candidate clauses
% 0.10/0.28 # 6 unit axiom clauses
% 0.10/0.28
% 0.10/0.28 # Requested 8, 32 cores available to the main process.
% 0.10/0.28 # There are not enough tableaux to fork, creating more from the initial 6
% 0.10/0.28 # Returning from population with 73 new_tableaux and 0 remaining starting tableaux.
% 0.10/0.28 # We now have 73 tableaux to operate on
% 0.10/0.29 # There were 3 total branch saturation attempts.
% 0.10/0.29 # There were 0 of these attempts blocked.
% 0.10/0.29 # There were 0 deferred branch saturation attempts.
% 0.10/0.29 # There were 0 free duplicated saturations.
% 0.10/0.29 # There were 3 total successful branch saturations.
% 0.10/0.29 # There were 0 successful branch saturations in interreduction.
% 0.10/0.29 # There were 0 successful branch saturations on the branch.
% 0.10/0.29 # There were 3 successful branch saturations after the branch.
% 0.10/0.29 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.29 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.29 # Begin clausification derivation
% 0.10/0.29
% 0.10/0.29 # End clausification derivation
% 0.10/0.29 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.10/0.29 cnf(i_0_7, negated_conjecture, (p15(esk2_0))).
% 0.10/0.29 cnf(i_0_5, negated_conjecture, (p1(esk3_0))).
% 0.10/0.29 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.10/0.29 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk4_0))).
% 0.10/0.29 cnf(i_0_6, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.10/0.29 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.10/0.29 cnf(i_0_3, negated_conjecture, (epred1_1(X1)|~r1(esk4_0,X1))).
% 0.10/0.29 cnf(i_0_36, plain, (~epred1_1(X1)|~p15(esk18_1(X1)))).
% 0.10/0.29 cnf(i_0_9, plain, (~epred1_1(X1)|~p2(esk19_1(X1))|~p1(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_33, plain, (~epred1_1(X1)|~p13(esk19_1(X1))|~p14(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_31, plain, (~epred1_1(X1)|~p12(esk19_1(X1))|~p13(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_76, plain, (r1(X1,esk5_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_37, plain, (r1(X1,esk18_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_35, plain, (r1(X1,esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_29, plain, (~epred1_1(X1)|~p11(esk19_1(X1))|~p12(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_27, plain, (~epred1_1(X1)|~p10(esk19_1(X1))|~p11(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_10, plain, (p2(esk19_1(X1))|p1(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_75, plain, (r1(esk5_1(X1),esk6_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_25, plain, (~epred1_1(X1)|~p9(esk19_1(X1))|~p10(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_23, plain, (~epred1_1(X1)|~p8(esk19_1(X1))|~p9(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_21, plain, (~epred1_1(X1)|~p7(esk19_1(X1))|~p8(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_19, plain, (~epred1_1(X1)|~p6(esk19_1(X1))|~p7(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_74, plain, (r1(esk6_1(X1),esk7_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_17, plain, (~epred1_1(X1)|~p5(esk19_1(X1))|~p6(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_15, plain, (~epred1_1(X1)|~p4(esk19_1(X1))|~p5(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_13, plain, (~epred1_1(X1)|~p3(esk19_1(X1))|~p4(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_11, plain, (~epred1_1(X1)|~p2(esk19_1(X1))|~p3(esk19_1(X1)))).
% 0.10/0.29 cnf(i_0_34, plain, (p13(esk19_1(X1))|p14(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_73, plain, (r1(esk7_1(X1),esk8_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_38, plain, (p2(X1)|~epred1_1(X2)|~p1(X1)|~r1(X2,X1))).
% 0.10/0.29 cnf(i_0_62, plain, (p14(X1)|~epred1_1(X2)|~p13(X1)|~r1(esk16_1(X2),X1))).
% 0.10/0.29 cnf(i_0_63, plain, (p13(X1)|~epred1_1(X2)|~p14(X1)|~r1(esk16_1(X2),X1))).
% 0.10/0.29 cnf(i_0_60, plain, (p13(X1)|~epred1_1(X2)|~p12(X1)|~r1(esk15_1(X2),X1))).
% 0.10/0.29 cnf(i_0_72, plain, (r1(esk8_1(X1),esk9_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_39, plain, (p1(X1)|~epred1_1(X2)|~p2(X1)|~r1(X2,X1))).
% 0.10/0.29 cnf(i_0_71, plain, (r1(esk9_1(X1),esk10_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_70, plain, (r1(esk10_1(X1),esk11_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_69, plain, (r1(esk11_1(X1),esk12_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_32, plain, (p12(esk19_1(X1))|p13(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_68, plain, (r1(esk12_1(X1),esk13_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_61, plain, (p12(X1)|~epred1_1(X2)|~p13(X1)|~r1(esk15_1(X2),X1))).
% 0.10/0.29 cnf(i_0_58, plain, (p12(X1)|~epred1_1(X2)|~p11(X1)|~r1(esk14_1(X2),X1))).
% 0.10/0.29 cnf(i_0_59, plain, (p11(X1)|~epred1_1(X2)|~p12(X1)|~r1(esk14_1(X2),X1))).
% 0.10/0.29 cnf(i_0_56, plain, (p11(X1)|~epred1_1(X2)|~p10(X1)|~r1(esk13_1(X2),X1))).
% 0.10/0.29 cnf(i_0_67, plain, (r1(esk13_1(X1),esk14_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_66, plain, (r1(esk14_1(X1),esk15_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_65, plain, (r1(esk15_1(X1),esk16_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_64, plain, (r1(esk16_1(X1),esk17_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_57, plain, (p10(X1)|~epred1_1(X2)|~p11(X1)|~r1(esk13_1(X2),X1))).
% 0.10/0.29 cnf(i_0_30, plain, (p11(esk19_1(X1))|p12(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_28, plain, (p10(esk19_1(X1))|p11(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_54, plain, (p10(X1)|~epred1_1(X2)|~p9(X1)|~r1(esk12_1(X2),X1))).
% 0.10/0.29 cnf(i_0_55, plain, (p9(X1)|~epred1_1(X2)|~p10(X1)|~r1(esk12_1(X2),X1))).
% 0.10/0.29 cnf(i_0_52, plain, (p9(X1)|~epred1_1(X2)|~p8(X1)|~r1(esk11_1(X2),X1))).
% 0.10/0.29 cnf(i_0_53, plain, (p8(X1)|~epred1_1(X2)|~p9(X1)|~r1(esk11_1(X2),X1))).
% 0.10/0.29 cnf(i_0_26, plain, (p9(esk19_1(X1))|p10(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_50, plain, (p8(X1)|~epred1_1(X2)|~p7(X1)|~r1(esk10_1(X2),X1))).
% 0.10/0.29 cnf(i_0_51, plain, (p7(X1)|~epred1_1(X2)|~p8(X1)|~r1(esk10_1(X2),X1))).
% 0.10/0.29 cnf(i_0_48, plain, (p7(X1)|~epred1_1(X2)|~p6(X1)|~r1(esk9_1(X2),X1))).
% 0.10/0.29 cnf(i_0_49, plain, (p6(X1)|~epred1_1(X2)|~p7(X1)|~r1(esk9_1(X2),X1))).
% 0.10/0.29 cnf(i_0_24, plain, (p8(esk19_1(X1))|p9(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_22, plain, (p7(esk19_1(X1))|p8(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_46, plain, (p6(X1)|~epred1_1(X2)|~p5(X1)|~r1(esk8_1(X2),X1))).
% 0.10/0.29 cnf(i_0_47, plain, (p5(X1)|~epred1_1(X2)|~p6(X1)|~r1(esk8_1(X2),X1))).
% 0.10/0.29 cnf(i_0_44, plain, (p5(X1)|~epred1_1(X2)|~p4(X1)|~r1(esk7_1(X2),X1))).
% 0.10/0.29 cnf(i_0_45, plain, (p4(X1)|~epred1_1(X2)|~p5(X1)|~r1(esk7_1(X2),X1))).
% 0.10/0.29 cnf(i_0_20, plain, (p6(esk19_1(X1))|p7(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_42, plain, (p4(X1)|~epred1_1(X2)|~p3(X1)|~r1(esk6_1(X2),X1))).
% 0.10/0.29 cnf(i_0_43, plain, (p3(X1)|~epred1_1(X2)|~p4(X1)|~r1(esk6_1(X2),X1))).
% 0.10/0.29 cnf(i_0_40, plain, (p3(X1)|~epred1_1(X2)|~p2(X1)|~r1(esk5_1(X2),X1))).
% 0.10/0.29 cnf(i_0_41, plain, (p2(X1)|~epred1_1(X2)|~p3(X1)|~r1(esk5_1(X2),X1))).
% 0.10/0.29 cnf(i_0_18, plain, (p5(esk19_1(X1))|p6(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_16, plain, (p4(esk19_1(X1))|p5(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))).
% 0.10/0.29 cnf(i_0_14, plain, (p3(esk19_1(X1))|p4(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 cnf(i_0_12, plain, (p2(esk19_1(X1))|p3(esk19_1(X1))|~epred1_1(X1))).
% 0.10/0.29 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.10/0.29 # Begin printing tableau
% 0.10/0.29 # Found 8 steps
% 0.10/0.29 cnf(i_0_3, negated_conjecture, (epred1_1(esk4_0)|~r1(esk4_0,esk4_0)), inference(start_rule)).
% 0.10/0.29 cnf(i_0_78, plain, (~r1(esk4_0,esk4_0)), inference(closure_rule, [i_0_1])).
% 0.10/0.29 cnf(i_0_77, plain, (epred1_1(esk4_0)), inference(extension_rule, [i_0_12])).
% 0.10/0.29 cnf(i_0_298, plain, (p2(esk19_1(esk4_0))), inference(extension_rule, [i_0_39])).
% 0.10/0.29 cnf(i_0_381, plain, (~epred1_1(esk4_0)), inference(closure_rule, [i_0_77])).
% 0.10/0.29 cnf(i_0_299, plain, (p3(esk19_1(esk4_0))), inference(etableau_closure_rule, [i_0_299, ...])).
% 0.10/0.29 cnf(i_0_380, plain, (p1(esk19_1(esk4_0))), inference(etableau_closure_rule, [i_0_380, ...])).
% 0.10/0.29 cnf(i_0_383, plain, (~r1(esk4_0,esk19_1(esk4_0))), inference(etableau_closure_rule, [i_0_383, ...])).
% 0.10/0.29 # End printing tableau
% 0.10/0.29 # SZS output end
% 0.10/0.29 # Branches closed with saturation will be marked with an "s"
% 0.10/0.29 # Child (676) has found a proof.
% 0.10/0.29
% 0.10/0.29 # Proof search is over...
% 0.10/0.29 # Freeing feature tree
%------------------------------------------------------------------------------