TSTP Solution File: LCL668+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL668+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 : n013.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:11 EDT 2022
% Result : Theorem 16.64s 2.53s
% Output : CNFRefutation 16.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL668+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12 % 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 : n013.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 : Sun Jul 3 07:25:44 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___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.13/0.37 # and selection function SelectNewComplexAHP.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 35 Number of unprocessed: 35
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/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 # 35 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 34 conjectures.
% 0.19/0.37 # There are 34 start rule candidates:
% 0.19/0.37 # Found 15 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 34 start rule tableaux created.
% 0.19/0.37 # 20 extension rule candidate clauses
% 0.19/0.37 # 15 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 16.64/2.53 # Closed tableau found in foldup close cycle with 0 folds and 9 closures done.
% 16.64/2.53 # There were 3 total branch saturation attempts.
% 16.64/2.53 # There were 0 of these attempts blocked.
% 16.64/2.53 # There were 0 deferred branch saturation attempts.
% 16.64/2.53 # There were 0 free duplicated saturations.
% 16.64/2.53 # There were 1 total successful branch saturations.
% 16.64/2.53 # There were 0 successful branch saturations in interreduction.
% 16.64/2.53 # There were 0 successful branch saturations on the branch.
% 16.64/2.53 # There were 1 successful branch saturations after the branch.
% 16.64/2.53 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.64/2.53 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.64/2.53 # Begin clausification derivation
% 16.64/2.53
% 16.64/2.53 # End clausification derivation
% 16.64/2.53 # Begin listing active clauses obtained from FOF to CNF conversion
% 16.64/2.53 cnf(i_0_35, negated_conjecture, (r1(esk1_0,esk2_0))).
% 16.64/2.53 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk8_0))).
% 16.64/2.53 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk13_0))).
% 16.64/2.53 cnf(i_0_34, negated_conjecture, (r1(esk2_0,esk3_0))).
% 16.64/2.53 cnf(i_0_33, negated_conjecture, (r1(esk3_0,esk4_0))).
% 16.64/2.53 cnf(i_0_32, negated_conjecture, (r1(esk4_0,esk5_0))).
% 16.64/2.53 cnf(i_0_31, negated_conjecture, (r1(esk5_0,esk6_0))).
% 16.64/2.53 cnf(i_0_30, negated_conjecture, (r1(esk6_0,esk7_0))).
% 16.64/2.53 cnf(i_0_7, negated_conjecture, (r1(esk13_0,esk14_0))).
% 16.64/2.53 cnf(i_0_6, negated_conjecture, (r1(esk14_0,esk15_0))).
% 16.64/2.53 cnf(i_0_5, negated_conjecture, (r1(esk15_0,esk16_0))).
% 16.64/2.53 cnf(i_0_4, negated_conjecture, (r1(esk16_0,esk17_0))).
% 16.64/2.53 cnf(i_0_3, negated_conjecture, (r1(esk17_0,esk18_0))).
% 16.64/2.53 cnf(i_0_1, plain, (r1(X1,X1))).
% 16.64/2.53 cnf(i_0_27, negated_conjecture, (~p7(esk8_0))).
% 16.64/2.53 cnf(i_0_23, negated_conjecture, (~p6(esk9_1(X1))|~r1(esk1_0,X1))).
% 16.64/2.53 cnf(i_0_2, negated_conjecture, (~p3(esk18_0)|~p1(esk18_0)|~p5(esk18_0)|~p2(esk18_0)|~p4(esk18_0)|~p6(esk18_0))).
% 16.64/2.53 cnf(i_0_24, negated_conjecture, (r1(X1,esk9_1(X1))|~r1(esk1_0,X1))).
% 16.64/2.53 cnf(i_0_19, negated_conjecture, (~p5(esk10_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 16.64/2.53 cnf(i_0_15, negated_conjecture, (~p4(esk11_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 16.64/2.53 cnf(i_0_20, negated_conjecture, (r1(X1,esk10_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 16.64/2.53 cnf(i_0_11, negated_conjecture, (~p3(esk12_4(X1,X2,X3,X4))|~r1(esk1_0,X1)|~r1(X3,X4)|~r1(X2,X3)|~r1(X1,X2))).
% 16.64/2.53 cnf(i_0_29, negated_conjecture, (p2(esk7_0)|p4(esk7_0)|p6(esk7_0)|p8(esk7_0)|p10(esk7_0)|p12(esk7_0))).
% 16.64/2.53 cnf(i_0_16, negated_conjecture, (r1(X1,esk11_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 16.64/2.53 cnf(i_0_21, negated_conjecture, (~p5(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_17, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_9, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_22, negated_conjecture, (p5(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_12, negated_conjecture, (r1(X1,esk12_4(X2,X3,X4,X1))|~r1(esk1_0,X2)|~r1(X4,X1)|~r1(X3,X4)|~r1(X2,X3))).
% 16.64/2.53 cnf(i_0_13, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_25, negated_conjecture, (~p1(X1)|~p5(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_18, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_10, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_14, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 cnf(i_0_26, negated_conjecture, (p1(X1)|p5(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))).
% 16.64/2.53 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 16.64/2.53 # Begin printing tableau
% 16.64/2.53 # Found 51 steps
% 16.64/2.53 cnf(i_0_12, negated_conjecture, (r1(esk1_0,esk12_4(esk1_0,esk1_0,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)).
% 16.64/2.53 cnf(i_0_97, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_98, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_99, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_100, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_96, plain, (r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_26])).
% 16.64/2.53 cnf(i_0_193, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_194, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_195, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_196, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_197, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_198, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_199, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_190, plain, (p1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_9])).
% 16.64/2.53 cnf(i_0_267, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_268, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_269, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_270, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_271, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_272, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_273, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_274, plain, (~r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_96])).
% 16.64/2.53 cnf(i_0_266, plain, (~p2(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_14])).
% 16.64/2.53 cnf(i_0_22004, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22005, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22006, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22007, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22008, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22009, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22010, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22011, plain, (~r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_96])).
% 16.64/2.53 cnf(i_0_191, plain, (p5(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_21])).
% 16.64/2.53 cnf(i_0_22079, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22080, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22081, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22082, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22083, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22084, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22085, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_22086, plain, (~r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_96])).
% 16.64/2.53 cnf(i_0_22002, plain, (p3(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_22002, ...])).
% 16.64/2.53 cnf(i_0_22078, plain, (~p4(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_18])).
% 16.64/2.53 cnf(i_0_39904, plain, (p3(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_547])).
% 16.64/2.53 cnf(i_0_39906, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_39907, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_39908, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_39909, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_39910, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_39911, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_39912, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 16.64/2.53 cnf(i_0_39913, plain, (~r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_96])).
% 16.64/2.53 # End printing tableau
% 16.64/2.53 # SZS output end
% 16.64/2.53 # Branches closed with saturation will be marked with an "s"
% 17.39/2.55 # Child (17721) has found a proof.
% 17.39/2.55
% 17.39/2.55 # Proof search is over...
% 17.39/2.55 # Freeing feature tree
%------------------------------------------------------------------------------