TSTP Solution File: LCL670+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL670+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 : 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:24:14 EDT 2022
% Result : Theorem 24.98s 3.41s
% Output : CNFRefutation 24.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL670+1.001 : 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 : n024.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 00:42:59 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.07/0.27 # No SInE strategy applied
% 0.07/0.27 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.07/0.27 # and selection function SelectNewComplexAHP.
% 0.07/0.27 #
% 0.07/0.27 # Presaturation interreduction done
% 0.07/0.27 # Number of axioms: 32 Number of unprocessed: 32
% 0.07/0.27 # Tableaux proof search.
% 0.07/0.27 # APR header successfully linked.
% 0.07/0.27 # Hello from C++
% 0.07/0.27 # The folding up rule is enabled...
% 0.07/0.27 # Local unification is enabled...
% 0.07/0.27 # Any saturation attempts will use folding labels...
% 0.07/0.27 # 32 beginning clauses after preprocessing and clausification
% 0.07/0.27 # Creating start rules for all 31 conjectures.
% 0.07/0.27 # There are 31 start rule candidates:
% 0.07/0.27 # Found 6 unit axioms.
% 0.07/0.27 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.07/0.27 # 31 start rule tableaux created.
% 0.07/0.27 # 26 extension rule candidate clauses
% 0.07/0.27 # 6 unit axiom clauses
% 0.07/0.27
% 0.07/0.27 # Requested 8, 32 cores available to the main process.
% 24.98/3.41 # There were 6 total branch saturation attempts.
% 24.98/3.41 # There were 0 of these attempts blocked.
% 24.98/3.41 # There were 0 deferred branch saturation attempts.
% 24.98/3.41 # There were 0 free duplicated saturations.
% 24.98/3.41 # There were 6 total successful branch saturations.
% 24.98/3.41 # There were 0 successful branch saturations in interreduction.
% 24.98/3.41 # There were 0 successful branch saturations on the branch.
% 24.98/3.41 # There were 6 successful branch saturations after the branch.
% 24.98/3.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.98/3.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.98/3.41 # Begin clausification derivation
% 24.98/3.41
% 24.98/3.41 # End clausification derivation
% 24.98/3.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 24.98/3.41 cnf(i_0_11, negated_conjecture, (r1(esk1_0,esk10_0))).
% 24.98/3.41 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk13_0))).
% 24.98/3.41 cnf(i_0_10, negated_conjecture, (r1(esk10_0,esk11_0))).
% 24.98/3.41 cnf(i_0_8, negated_conjecture, (r1(esk10_0,esk12_0))).
% 24.98/3.41 cnf(i_0_1, plain, (r1(X1,X1))).
% 24.98/3.41 cnf(i_0_7, negated_conjecture, (~p1(esk12_0))).
% 24.98/3.41 cnf(i_0_9, negated_conjecture, (p1(X1)|~r1(esk11_0,X1))).
% 24.98/3.41 cnf(i_0_32, negated_conjecture, (~p4(X1)|~r1(esk1_0,X1))).
% 24.98/3.41 cnf(i_0_4, negated_conjecture, (~p2(esk14_1(X1))|~r1(esk13_0,X1))).
% 24.98/3.41 cnf(i_0_29, negated_conjecture, (~p3(esk3_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 24.98/3.41 cnf(i_0_5, negated_conjecture, (r1(X1,esk14_1(X1))|~r1(esk13_0,X1))).
% 24.98/3.41 cnf(i_0_28, negated_conjecture, (p2(esk2_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 24.98/3.41 cnf(i_0_12, negated_conjecture, (p1(X1)|~p1(esk9_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 24.98/3.41 cnf(i_0_2, negated_conjecture, (p1(esk15_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))).
% 24.98/3.41 cnf(i_0_3, negated_conjecture, (r1(X1,esk15_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))).
% 24.98/3.41 cnf(i_0_31, negated_conjecture, (r1(X1,esk2_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 24.98/3.41 cnf(i_0_13, negated_conjecture, (p1(X1)|r1(X2,esk9_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 24.98/3.41 cnf(i_0_30, negated_conjecture, (r1(esk2_2(X1,X2),esk3_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 24.98/3.41 cnf(i_0_16, negated_conjecture, (~p2(X1)|~p3(esk7_3(X2,X3,X4))|~r1(esk8_1(X2),X1)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X2,X3))).
% 24.98/3.41 cnf(i_0_17, negated_conjecture, (r1(X1,esk8_1(X1))|~p3(esk7_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 24.98/3.41 cnf(i_0_20, negated_conjecture, (r1(X1,esk6_3(X2,X3,X1))|~p2(X4)|~r1(esk8_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 24.98/3.41 cnf(i_0_24, negated_conjecture, (~p2(X1)|~p2(X2)|~p3(esk4_3(X3,X2,X4))|~r1(esk5_3(X3,X2,X5),X1)|~r1(esk1_0,X3)|~r1(X2,X4)|~r1(X2,X5)|~r1(X3,X2))).
% 24.98/3.41 cnf(i_0_15, negated_conjecture, (p2(esk6_3(X1,X2,X3))|r1(X1,esk8_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 24.98/3.41 cnf(i_0_14, negated_conjecture, (p2(esk6_3(X1,X2,X3))|~p2(X4)|~r1(esk8_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 24.98/3.41 cnf(i_0_22, negated_conjecture, (p2(X1)|~p2(X2)|~p2(X3)|~r1(esk5_3(X4,X3,X5),X2)|~r1(esk1_0,X4)|~r1(X3,X1)|~r1(X3,X5)|~r1(X4,X3))).
% 24.98/3.41 cnf(i_0_23, negated_conjecture, (p2(X1)|r1(X2,esk5_3(X3,X4,X2))|~p2(X4)|~r1(esk1_0,X3)|~r1(X4,X1)|~r1(X4,X2)|~r1(X3,X4))).
% 24.98/3.41 cnf(i_0_18, negated_conjecture, (r1(esk6_3(X1,X2,X3),esk7_3(X1,X2,X3))|~p2(X4)|~r1(esk8_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 24.98/3.41 cnf(i_0_21, negated_conjecture, (r1(X1,esk6_3(X2,X3,X1))|r1(X2,esk8_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 24.98/3.41 cnf(i_0_19, negated_conjecture, (r1(esk6_3(X1,X2,X3),esk7_3(X1,X2,X3))|r1(X1,esk8_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 24.98/3.41 cnf(i_0_25, negated_conjecture, (r1(X1,esk5_3(X2,X3,X1))|~p2(X3)|~p3(esk4_3(X2,X3,X4))|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))).
% 24.98/3.41 cnf(i_0_26, negated_conjecture, (r1(X1,esk4_3(X2,X3,X1))|~p2(X4)|~p2(X3)|~r1(esk5_3(X2,X3,X5),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X3,X5)|~r1(X2,X3))).
% 24.98/3.41 cnf(i_0_27, negated_conjecture, (r1(X1,esk5_3(X2,X3,X1))|r1(X4,esk4_3(X2,X3,X4))|~p2(X3)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))).
% 24.98/3.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 24.98/3.41 # Begin printing tableau
% 24.98/3.41 # Found 21 steps
% 24.98/3.41 cnf(i_0_23, negated_conjecture, (p2(esk1_0)|r1(esk1_0,esk5_3(esk1_0,esk1_0,esk1_0))|~p2(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)).
% 24.98/3.41 cnf(i_0_74, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_75, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_76, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_77, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_71, plain, (p2(esk1_0)), inference(extension_rule, [i_0_27])).
% 24.98/3.41 cnf(i_0_170, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_171, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_172, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_173, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_167, plain, (r1(esk1_0,esk5_3(esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_26])).
% 24.98/3.41 cnf(i_0_175, plain, (~p2(esk1_0)), inference(closure_rule, [i_0_71])).
% 24.98/3.41 cnf(i_0_176, plain, (~p2(esk1_0)), inference(closure_rule, [i_0_71])).
% 24.98/3.41 cnf(i_0_179, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_180, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 24.98/3.41 cnf(i_0_72, plain, (r1(esk1_0,esk5_3(esk1_0,esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_72, ...])).
% 24.98/3.41 cnf(i_0_73, plain, (~p2(esk1_0)), inference(etableau_closure_rule, [i_0_73, ...])).
% 24.98/3.41 cnf(i_0_168, plain, (r1(esk1_0,esk4_3(esk1_0,esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_168, ...])).
% 24.98/3.41 cnf(i_0_174, plain, (r1(esk1_0,esk4_3(esk5_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_174, ...])).
% 24.98/3.41 cnf(i_0_177, plain, (~r1(esk5_3(esk5_3(esk1_0,esk1_0,esk1_0),esk1_0,esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_177, ...])).
% 24.98/3.41 cnf(i_0_181, plain, (~r1(esk5_3(esk1_0,esk1_0,esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_181, ...])).
% 24.98/3.41 # End printing tableau
% 24.98/3.41 # SZS output end
% 24.98/3.41 # Branches closed with saturation will be marked with an "s"
% 24.98/3.41 # Child (7833) has found a proof.
% 24.98/3.41
% 24.98/3.41 # Proof search is over...
% 24.98/3.41 # Freeing feature tree
%------------------------------------------------------------------------------