TSTP Solution File: LCL656+1.005 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL656+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 : n024.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:55 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL656+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.10/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.32 % Computer : n024.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 4 18:56:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.12/0.36 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 63 Number of unprocessed: 63
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # 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 # 63 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 4 conjectures.
% 0.12/0.37 # There are 4 start rule candidates:
% 0.12/0.37 # Found 3 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 4 start rule tableaux created.
% 0.12/0.37 # 60 extension rule candidate clauses
% 0.12/0.37 # 3 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.37 # Returning from population with 61 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 61 tableaux to operate on
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_2, negated_conjecture, (p100(esk1_0))).
% 0.12/0.39 cnf(i_0_1, plain, (r1(X1,X1))).
% 0.12/0.39 cnf(i_0_3, negated_conjecture, (~p101(esk1_0))).
% 0.12/0.39 cnf(i_0_6, plain, (p100(X1)|~epred1_1(X1)|~p101(X1))).
% 0.12/0.39 cnf(i_0_7, plain, (p101(X1)|~epred1_1(X1)|~p102(X1))).
% 0.12/0.39 cnf(i_0_11, plain, (p105(X1)|~epred1_1(X1)|~p106(X1))).
% 0.12/0.39 cnf(i_0_10, plain, (p104(X1)|~epred1_1(X1)|~p105(X1))).
% 0.12/0.39 cnf(i_0_9, plain, (p103(X1)|~epred1_1(X1)|~p104(X1))).
% 0.12/0.39 cnf(i_0_8, plain, (p102(X1)|~epred1_1(X1)|~p103(X1))).
% 0.12/0.39 cnf(i_0_62, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p6(esk2_1(X1)))).
% 0.12/0.39 cnf(i_0_61, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p106(esk2_1(X1)))).
% 0.12/0.39 cnf(i_0_28, plain, (p101(esk10_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))).
% 0.12/0.39 cnf(i_0_38, plain, (p102(X1)|~epred1_1(X1)|~p101(X1)|~p3(esk8_1(X1)))).
% 0.12/0.39 cnf(i_0_29, plain, (p101(X1)|~epred1_1(X1)|~p100(X1)|~p102(esk10_1(X1)))).
% 0.12/0.39 cnf(i_0_25, plain, (p101(X1)|~epred1_1(X1)|~p100(X1)|~p102(esk11_1(X1)))).
% 0.12/0.39 cnf(i_0_30, plain, (p101(X1)|~epred1_1(X1)|~p100(X1)|~p2(esk10_1(X1)))).
% 0.12/0.39 cnf(i_0_58, plain, (p105(X1)|p6(esk3_1(X1))|~epred1_1(X1)|~p104(X1))).
% 0.12/0.39 cnf(i_0_24, plain, (p101(esk11_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))).
% 0.12/0.39 cnf(i_0_57, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p106(esk3_1(X1)))).
% 0.12/0.39 cnf(i_0_53, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p105(esk4_1(X1)))).
% 0.12/0.39 cnf(i_0_49, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p105(esk5_1(X1)))).
% 0.12/0.39 cnf(i_0_54, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p5(esk4_1(X1)))).
% 0.12/0.39 cnf(i_0_34, plain, (p102(X1)|p3(esk9_1(X1))|~epred1_1(X1)|~p101(X1))).
% 0.12/0.39 cnf(i_0_37, plain, (p102(X1)|~epred1_1(X1)|~p101(X1)|~p103(esk8_1(X1)))).
% 0.12/0.39 cnf(i_0_33, plain, (p102(X1)|~epred1_1(X1)|~p101(X1)|~p103(esk9_1(X1)))).
% 0.12/0.39 cnf(i_0_45, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p104(esk6_1(X1)))).
% 0.12/0.39 cnf(i_0_41, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p104(esk7_1(X1)))).
% 0.12/0.39 cnf(i_0_60, plain, (p105(esk2_1(X1))|p105(X1)|~epred1_1(X1)|~p104(X1))).
% 0.12/0.39 cnf(i_0_26, plain, (p2(esk11_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))).
% 0.12/0.39 cnf(i_0_46, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p4(esk6_1(X1)))).
% 0.12/0.39 cnf(i_0_56, plain, (p105(esk3_1(X1))|p105(X1)|~epred1_1(X1)|~p104(X1))).
% 0.12/0.39 cnf(i_0_52, plain, (p104(esk4_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))).
% 0.12/0.39 cnf(i_0_48, plain, (p104(esk5_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))).
% 0.12/0.39 cnf(i_0_36, plain, (p102(esk8_1(X1))|p102(X1)|~epred1_1(X1)|~p101(X1))).
% 0.12/0.39 cnf(i_0_31, plain, (p101(X1)|r1(X1,esk10_1(X1))|~epred1_1(X1)|~p100(X1))).
% 0.12/0.39 cnf(i_0_27, plain, (p101(X1)|r1(X1,esk11_1(X1))|~epred1_1(X1)|~p100(X1))).
% 0.12/0.39 cnf(i_0_32, plain, (p102(esk9_1(X1))|p102(X1)|~epred1_1(X1)|~p101(X1))).
% 0.12/0.39 cnf(i_0_39, plain, (p102(X1)|r1(X1,esk8_1(X1))|~epred1_1(X1)|~p101(X1))).
% 0.12/0.39 cnf(i_0_50, plain, (p5(esk5_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))).
% 0.12/0.39 cnf(i_0_44, plain, (p103(esk6_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))).
% 0.12/0.39 cnf(i_0_40, plain, (p103(esk7_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))).
% 0.12/0.39 cnf(i_0_42, plain, (p4(esk7_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))).
% 0.12/0.39 cnf(i_0_17, plain, (p3(X1)|~epred1_1(X1)|~p102(X2)|~p102(X1)|~p3(X2)|~r1(X1,X2))).
% 0.12/0.39 cnf(i_0_23, plain, (p6(X1)|~epred1_1(X1)|~p105(X2)|~p105(X1)|~p6(X2)|~r1(X1,X2))).
% 0.12/0.39 cnf(i_0_35, plain, (p102(X1)|r1(X1,esk9_1(X1))|~epred1_1(X1)|~p101(X1))).
% 0.12/0.39 cnf(i_0_16, plain, (p3(X1)|~epred1_1(X2)|~p102(X1)|~p102(X2)|~p3(X2)|~r1(X2,X1))).
% 0.12/0.39 cnf(i_0_63, plain, (p105(X1)|r1(X1,esk2_1(X1))|~epred1_1(X1)|~p104(X1))).
% 0.12/0.39 cnf(i_0_59, plain, (p105(X1)|r1(X1,esk3_1(X1))|~epred1_1(X1)|~p104(X1))).
% 0.12/0.39 cnf(i_0_55, plain, (p104(X1)|r1(X1,esk4_1(X1))|~epred1_1(X1)|~p103(X1))).
% 0.12/0.39 cnf(i_0_51, plain, (p104(X1)|r1(X1,esk5_1(X1))|~epred1_1(X1)|~p103(X1))).
% 0.12/0.39 cnf(i_0_47, plain, (p103(X1)|r1(X1,esk6_1(X1))|~epred1_1(X1)|~p102(X1))).
% 0.12/0.39 cnf(i_0_21, plain, (p5(X1)|~epred1_1(X1)|~p5(X2)|~p104(X2)|~p104(X1)|~r1(X1,X2))).
% 0.12/0.39 cnf(i_0_19, plain, (p4(X1)|~epred1_1(X1)|~p4(X2)|~p103(X2)|~p103(X1)|~r1(X1,X2))).
% 0.12/0.39 cnf(i_0_15, plain, (p2(X1)|~epred1_1(X1)|~p2(X2)|~p101(X2)|~p101(X1)|~r1(X1,X2))).
% 0.12/0.39 cnf(i_0_13, plain, (p1(X1)|~epred1_1(X1)|~p1(X2)|~p100(X2)|~p100(X1)|~r1(X1,X2))).
% 0.12/0.39 cnf(i_0_43, plain, (p103(X1)|r1(X1,esk7_1(X1))|~epred1_1(X1)|~p102(X1))).
% 0.12/0.39 cnf(i_0_14, plain, (p2(X1)|~epred1_1(X2)|~p2(X2)|~p101(X1)|~p101(X2)|~r1(X2,X1))).
% 0.12/0.39 cnf(i_0_12, plain, (p1(X1)|~epred1_1(X2)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(X2,X1))).
% 0.12/0.39 cnf(i_0_22, plain, (p6(X1)|~epred1_1(X2)|~p105(X1)|~p105(X2)|~p6(X2)|~r1(X2,X1))).
% 0.12/0.39 cnf(i_0_20, plain, (p5(X1)|~epred1_1(X2)|~p5(X2)|~p104(X1)|~p104(X2)|~r1(X2,X1))).
% 0.12/0.39 cnf(i_0_18, plain, (p4(X1)|~epred1_1(X2)|~p4(X2)|~p103(X1)|~p103(X2)|~r1(X2,X1))).
% 0.12/0.39 cnf(i_0_5, negated_conjecture, (p3(X1)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X4,X3)|~r1(X5,X4)|~r1(X2,X5))).
% 0.12/0.39 cnf(i_0_4, negated_conjecture, (epred1_1(X1)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X4,X3)|~r1(X5,X4)|~r1(X2,X5))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 12 steps
% 0.12/0.39 cnf(i_0_4, negated_conjecture, (epred1_1(esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)).
% 0.12/0.39 cnf(i_0_65, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.39 cnf(i_0_66, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.39 cnf(i_0_67, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.39 cnf(i_0_68, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.39 cnf(i_0_69, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 0.12/0.39 cnf(i_0_64, plain, (epred1_1(esk1_0)), inference(extension_rule, [i_0_28])).
% 0.12/0.39 cnf(i_0_105, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])).
% 0.12/0.39 cnf(i_0_107, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])).
% 0.12/0.39 cnf(i_0_104, plain, (p101(esk10_1(esk1_0))), inference(extension_rule, [i_0_6])).
% 0.12/0.39 cnf(i_0_864, plain, (p100(esk10_1(esk1_0))), inference(etableau_closure_rule, [i_0_864, ...])).
% 0.12/0.39 cnf(i_0_865, plain, (~epred1_1(esk10_1(esk1_0))), inference(etableau_closure_rule, [i_0_865, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.40 # Child (27762) has found a proof.
% 0.12/0.40
% 0.12/0.40 # Proof search is over...
% 0.12/0.40 # Freeing feature tree
%------------------------------------------------------------------------------