TSTP Solution File: LCL671+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL671+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 : n027.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:15 EDT 2022
% Result : CounterSatisfiable 141.31s 18.12s
% Output : CNFRefutation 141.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL671+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 16:55:26 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: 36 Number of unprocessed: 36
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 36 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 35 conjectures.
% 0.13/0.37 # There are 35 start rule candidates:
% 0.13/0.37 # Found 6 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 35 start rule tableaux created.
% 0.13/0.37 # 30 extension rule candidate clauses
% 0.13/0.37 # 6 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 73.20/9.55 # Ran out of tableaux, making start rules for all clauses
% 104.11/13.43 # Ran out of tableaux, making start rules for all clauses
% 134.19/17.24 # Ran out of tableaux, making start rules for all clauses
% 141.31/18.10 # 19347 Satisfiable branch
% 141.31/18.12 # Satisfiable branch found.
% 141.31/18.12 # There were 69 total branch saturation attempts.
% 141.31/18.12 # There were 56 of these attempts blocked.
% 141.31/18.12 # There were 0 deferred branch saturation attempts.
% 141.31/18.12 # There were 0 free duplicated saturations.
% 141.31/18.12 # There were 2 total successful branch saturations.
% 141.31/18.12 # There were 2 successful branch saturations in interreduction.
% 141.31/18.12 # There were 0 successful branch saturations on the branch.
% 141.31/18.12 # There were 0 successful branch saturations after the branch.
% 141.31/18.12 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 141.31/18.12 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 141.31/18.12 # Begin clausification derivation
% 141.31/18.12
% 141.31/18.12 # End clausification derivation
% 141.31/18.12 # Begin listing active clauses obtained from FOF to CNF conversion
% 141.31/18.12 cnf(i_0_11, negated_conjecture, (r1(esk1_0,esk11_0))).
% 141.31/18.12 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk14_0))).
% 141.31/18.12 cnf(i_0_10, negated_conjecture, (r1(esk11_0,esk12_0))).
% 141.31/18.12 cnf(i_0_8, negated_conjecture, (r1(esk11_0,esk13_0))).
% 141.31/18.12 cnf(i_0_1, plain, (r1(X1,X1))).
% 141.31/18.12 cnf(i_0_7, negated_conjecture, (~p1(esk13_0))).
% 141.31/18.12 cnf(i_0_9, negated_conjecture, (p1(X1)|~r1(esk12_0,X1))).
% 141.31/18.12 cnf(i_0_36, negated_conjecture, (~p4(X1)|~r1(esk1_0,X1))).
% 141.31/18.12 cnf(i_0_4, negated_conjecture, (~p2(esk15_1(X1))|~r1(esk14_0,X1))).
% 141.31/18.12 cnf(i_0_16, negated_conjecture, (~p2(X1)|~p3(esk8_1(X2))|~r1(esk9_1(X2),X1)|~r1(esk1_0,X2))).
% 141.31/18.12 cnf(i_0_5, negated_conjecture, (r1(X1,esk15_1(X1))|~r1(esk14_0,X1))).
% 141.31/18.12 cnf(i_0_15, negated_conjecture, (p2(esk7_1(X1))|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))).
% 141.31/18.12 cnf(i_0_17, negated_conjecture, (r1(X1,esk9_1(X1))|~p3(esk8_1(X1))|~r1(esk1_0,X1))).
% 141.31/18.12 cnf(i_0_14, negated_conjecture, (p2(esk7_1(X1))|~p2(X2)|~r1(esk9_1(X1),X2)|~r1(esk1_0,X1))).
% 141.31/18.12 cnf(i_0_20, negated_conjecture, (r1(X1,esk7_1(X1))|~p2(X2)|~r1(esk9_1(X1),X2)|~r1(esk1_0,X1))).
% 141.31/18.12 cnf(i_0_18, negated_conjecture, (r1(esk7_1(X1),esk8_1(X1))|~p2(X2)|~r1(esk9_1(X1),X2)|~r1(esk1_0,X1))).
% 141.31/18.12 cnf(i_0_21, negated_conjecture, (r1(X1,esk9_1(X1))|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))).
% 141.31/18.12 cnf(i_0_19, negated_conjecture, (r1(esk7_1(X1),esk8_1(X1))|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))).
% 141.31/18.12 cnf(i_0_12, negated_conjecture, (p1(X1)|~p1(esk10_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 141.31/18.12 cnf(i_0_3, negated_conjecture, (r1(X1,esk16_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))).
% 141.31/18.12 cnf(i_0_2, negated_conjecture, (p1(esk16_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))).
% 141.31/18.12 cnf(i_0_24, negated_conjecture, (~p2(X1)|~p3(esk5_3(X2,X3,X4))|~r1(esk6_1(X2),X1)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X2,X3))).
% 141.31/18.12 cnf(i_0_13, negated_conjecture, (p1(X1)|r1(X2,esk10_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 141.31/18.12 cnf(i_0_25, negated_conjecture, (r1(X1,esk6_1(X1))|~p3(esk5_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 141.31/18.12 cnf(i_0_28, negated_conjecture, (r1(X1,esk4_3(X2,X3,X1))|~p2(X4)|~r1(esk6_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 141.31/18.12 cnf(i_0_23, negated_conjecture, (p2(esk4_3(X1,X2,X3))|r1(X1,esk6_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 141.31/18.12 cnf(i_0_22, negated_conjecture, (p2(esk4_3(X1,X2,X3))|~p2(X4)|~r1(esk6_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 141.31/18.12 cnf(i_0_29, negated_conjecture, (r1(X1,esk4_3(X2,X3,X1))|r1(X2,esk6_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 141.31/18.12 cnf(i_0_31, negated_conjecture, (p2(X1)|r1(X2,esk3_3(X3,X4,X2))|~p2(X4)|~r1(esk1_0,X3)|~r1(X4,X1)|~r1(X4,X2)|~r1(X3,X4))).
% 141.31/18.12 cnf(i_0_32, negated_conjecture, (~p2(X1)|~p2(X2)|~p3(esk2_3(X3,X2,X4))|~r1(esk3_3(X3,X2,X5),X1)|~r1(esk1_0,X3)|~r1(X2,X4)|~r1(X2,X5)|~r1(X3,X2))).
% 141.31/18.12 cnf(i_0_30, negated_conjecture, (p2(X1)|~p2(X2)|~p2(X3)|~r1(esk3_3(X4,X3,X5),X2)|~r1(esk1_0,X4)|~r1(X3,X1)|~r1(X3,X5)|~r1(X4,X3))).
% 141.31/18.12 cnf(i_0_33, negated_conjecture, (r1(X1,esk3_3(X2,X3,X1))|~p2(X3)|~p3(esk2_3(X2,X3,X4))|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))).
% 141.31/18.12 cnf(i_0_26, negated_conjecture, (r1(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3))|~p2(X4)|~r1(esk6_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 141.31/18.12 cnf(i_0_27, negated_conjecture, (r1(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3))|r1(X1,esk6_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 141.31/18.12 cnf(i_0_34, negated_conjecture, (r1(X1,esk2_3(X2,X3,X1))|~p2(X4)|~p2(X3)|~r1(esk3_3(X2,X3,X5),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X3,X5)|~r1(X2,X3))).
% 141.31/18.12 cnf(i_0_35, negated_conjecture, (r1(X1,esk3_3(X2,X3,X1))|r1(X4,esk2_3(X2,X3,X4))|~p2(X3)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))).
% 141.31/18.12 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 141.31/18.12 # Begin printing tableau
% 141.31/18.12 # Found 8 steps
% 141.31/18.12 cnf(i_0_8, negated_conjecture, (r1(esk11_0,esk13_0)), inference(start_rule)).
% 141.31/18.12 cnf(i_0_341646, plain, (p2(esk4_3(X5,esk11_0,esk13_0))), inference(closure_rule, [i_0_0])).
% 141.31/18.12 cnf(i_0_341648, plain, (~r1(esk6_1(X5),esk7_1(esk1_0))), inference(closure_rule, [i_0_0])).
% 141.31/18.12 cnf(i_0_341649, plain, (~r1(esk1_0,X5)), inference(closure_rule, [i_0_0])).
% 141.31/18.12 cnf(i_0_341651, plain, (~r1(X5,esk11_0)), inference(closure_rule, [i_0_0])).
% 141.31/18.12 cnf(i_0_183, plain, (r1(esk11_0,esk13_0)), inference(extension_rule, [i_0_22])).
% 141.31/18.12 cnf(i_0_341647, plain, (~p2(esk7_1(esk1_0))), inference(extension_rule, [i_0_15])).
% 141.31/18.12 cnf(i_0_598533, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])).
% 141.31/18.12 # End printing tableau
% 141.31/18.12 # SZS output end
% 141.31/18.12 # Branches closed with saturation will be marked with an "s"
% 141.31/18.12 # Child (19347) has found a proof.
% 141.31/18.12
% 141.31/18.12 # Proof search is over...
% 141.31/18.12 # Freeing feature tree
%------------------------------------------------------------------------------