TSTP Solution File: SEU406+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU406+1 : TPTP v8.1.0. Released v3.4.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 : n009.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 : Tue Jul 19 09:26:32 EDT 2022
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU406+1 : TPTP v8.1.0. Released v3.4.0.
% 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n009.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 19 16:42:22 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.40 # No SInE strategy applied
% 0.15/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.15/0.40 # and selection function SelectCQArNTNpEqFirst.
% 0.15/0.40 #
% 0.15/0.40 # Presaturation interreduction done
% 0.15/0.40 # Number of axioms: 30 Number of unprocessed: 30
% 0.15/0.40 # Tableaux proof search.
% 0.15/0.40 # APR header successfully linked.
% 0.15/0.40 # Hello from C++
% 0.15/0.40 # The folding up rule is enabled...
% 0.15/0.40 # Local unification is enabled...
% 0.15/0.40 # Any saturation attempts will use folding labels...
% 0.15/0.40 # 30 beginning clauses after preprocessing and clausification
% 0.15/0.40 # Creating start rules for all 6 conjectures.
% 0.15/0.40 # There are 6 start rule candidates:
% 0.15/0.40 # Found 12 unit axioms.
% 0.15/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.15/0.40 # 6 start rule tableaux created.
% 0.15/0.40 # 18 extension rule candidate clauses
% 0.15/0.40 # 12 unit axiom clauses
% 0.15/0.40
% 0.15/0.40 # Requested 8, 32 cores available to the main process.
% 0.15/0.40 # There are not enough tableaux to fork, creating more from the initial 6
% 0.15/0.40 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.40 # We now have 13 tableaux to operate on
% 0.15/0.41 # There were 1 total branch saturation attempts.
% 0.15/0.41 # There were 0 of these attempts blocked.
% 0.15/0.41 # There were 0 deferred branch saturation attempts.
% 0.15/0.41 # There were 0 free duplicated saturations.
% 0.15/0.41 # There were 1 total successful branch saturations.
% 0.15/0.41 # There were 0 successful branch saturations in interreduction.
% 0.15/0.41 # There were 0 successful branch saturations on the branch.
% 0.15/0.41 # There were 1 successful branch saturations after the branch.
% 0.15/0.41 # There were 1 total branch saturation attempts.
% 0.15/0.41 # There were 0 of these attempts blocked.
% 0.15/0.41 # There were 0 deferred branch saturation attempts.
% 0.15/0.41 # There were 0 free duplicated saturations.
% 0.15/0.41 # There were 1 total successful branch saturations.
% 0.15/0.41 # There were 0 successful branch saturations in interreduction.
% 0.15/0.41 # There were 0 successful branch saturations on the branch.
% 0.15/0.41 # There were 1 successful branch saturations after the branch.
% 0.15/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41 # Begin clausification derivation
% 0.15/0.41
% 0.15/0.41 # End clausification derivation
% 0.15/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.41 cnf(i_0_20, plain, (v1_xboole_0(k1_xboole_0))).
% 0.15/0.41 cnf(i_0_24, plain, (v1_xboole_0(esk7_0))).
% 0.15/0.41 cnf(i_0_31, plain, (k4_xboole_0(k1_xboole_0,X1)=k1_xboole_0)).
% 0.15/0.41 cnf(i_0_26, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.15/0.41 cnf(i_0_30, plain, (k4_xboole_0(X1,k1_xboole_0)=X1)).
% 0.15/0.41 cnf(i_0_23, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.15/0.41 cnf(i_0_19, plain, (m1_subset_1(esk6_1(X1),X1))).
% 0.15/0.41 cnf(i_0_5, negated_conjecture, (r2_hidden(esk2_0,k2_xboole_0(esk4_0,esk3_0)))).
% 0.15/0.41 cnf(i_0_6, negated_conjecture, (r2_hidden(esk1_0,k2_xboole_0(esk4_0,esk3_0)))).
% 0.15/0.41 cnf(i_0_29, plain, (k2_xboole_0(X1,k4_xboole_0(X2,X1))=k2_xboole_0(X1,X2))).
% 0.15/0.41 cnf(i_0_8, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.15/0.41 cnf(i_0_25, plain, (~v1_xboole_0(esk8_0))).
% 0.15/0.41 cnf(i_0_3, negated_conjecture, (~r2_hidden(esk1_0,esk4_0)|~r2_hidden(esk2_0,esk4_0))).
% 0.15/0.41 cnf(i_0_1, negated_conjecture, (~r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0))|~r2_hidden(esk1_0,esk4_0))).
% 0.15/0.41 cnf(i_0_2, negated_conjecture, (~r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))|~r2_hidden(esk2_0,esk4_0))).
% 0.15/0.41 cnf(i_0_33, plain, (~v1_xboole_0(X1)|~r2_hidden(X2,X1))).
% 0.15/0.41 cnf(i_0_32, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.15/0.41 cnf(i_0_7, plain, (~r2_hidden(X1,X2)|~r2_hidden(X2,X1))).
% 0.15/0.41 cnf(i_0_4, negated_conjecture, (~r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))|~r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)))).
% 0.15/0.41 cnf(i_0_34, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.15/0.41 cnf(i_0_22, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.15/0.41 cnf(i_0_21, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.15/0.41 cnf(i_0_27, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.15/0.41 cnf(i_0_28, plain, (v1_xboole_0(X1)|r2_hidden(X2,X1)|~m1_subset_1(X2,X1))).
% 0.15/0.41 cnf(i_0_12, plain, (r2_hidden(X1,k2_xboole_0(X2,X3))|~r2_hidden(X1,X3))).
% 0.15/0.41 cnf(i_0_13, plain, (r2_hidden(X1,k2_xboole_0(X2,X3))|~r2_hidden(X1,X2))).
% 0.15/0.41 cnf(i_0_14, plain, (r2_hidden(X1,X2)|r2_hidden(X1,X3)|~r2_hidden(X1,k2_xboole_0(X3,X2)))).
% 0.15/0.41 cnf(i_0_10, plain, (X1=k2_xboole_0(X2,X3)|~r2_hidden(esk5_3(X2,X3,X1),X1)|~r2_hidden(esk5_3(X2,X3,X1),X3))).
% 0.15/0.41 cnf(i_0_11, plain, (X1=k2_xboole_0(X2,X3)|~r2_hidden(esk5_3(X2,X3,X1),X1)|~r2_hidden(esk5_3(X2,X3,X1),X2))).
% 0.15/0.41 cnf(i_0_9, plain, (X1=k2_xboole_0(X2,X3)|r2_hidden(esk5_3(X2,X3,X1),X2)|r2_hidden(esk5_3(X2,X3,X1),X3)|r2_hidden(esk5_3(X2,X3,X1),X1))).
% 0.15/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.41 # Begin printing tableau
% 0.15/0.41 # Found 4 steps
% 0.15/0.41 cnf(i_0_6, negated_conjecture, (r2_hidden(esk1_0,k2_xboole_0(esk4_0,esk3_0))), inference(start_rule)).
% 0.15/0.41 cnf(i_0_46, plain, (r2_hidden(esk1_0,k2_xboole_0(esk4_0,esk3_0))), inference(extension_rule, [i_0_33])).
% 0.15/0.41 cnf(i_0_177, plain, (~v1_xboole_0(k2_xboole_0(esk4_0,esk3_0))), inference(extension_rule, [i_0_22])).
% 0.15/0.41 cnf(i_0_187, plain, (~v1_xboole_0(k2_xboole_0(X4,k2_xboole_0(esk4_0,esk3_0)))), inference(etableau_closure_rule, [i_0_187, ...])).
% 0.15/0.41 # End printing tableau
% 0.15/0.41 # SZS output end
% 0.15/0.41 # Branches closed with saturation will be marked with an "s"
% 0.15/0.41 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41 # Begin clausification derivation
% 0.15/0.41
% 0.15/0.41 # End clausification derivation
% 0.15/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.41 cnf(i_0_20, plain, (v1_xboole_0(k1_xboole_0))).
% 0.15/0.41 cnf(i_0_24, plain, (v1_xboole_0(esk7_0))).
% 0.15/0.41 cnf(i_0_31, plain, (k4_xboole_0(k1_xboole_0,X1)=k1_xboole_0)).
% 0.15/0.41 cnf(i_0_26, plain, (k2_xboole_0(X1,k1_xboole_0)=X1)).
% 0.15/0.41 cnf(i_0_30, plain, (k4_xboole_0(X1,k1_xboole_0)=X1)).
% 0.15/0.41 cnf(i_0_23, plain, (k2_xboole_0(X1,X1)=X1)).
% 0.15/0.41 cnf(i_0_19, plain, (m1_subset_1(esk6_1(X1),X1))).
% 0.15/0.41 cnf(i_0_5, negated_conjecture, (r2_hidden(esk2_0,k2_xboole_0(esk4_0,esk3_0)))).
% 0.15/0.41 cnf(i_0_6, negated_conjecture, (r2_hidden(esk1_0,k2_xboole_0(esk4_0,esk3_0)))).
% 0.15/0.41 cnf(i_0_29, plain, (k2_xboole_0(X1,k4_xboole_0(X2,X1))=k2_xboole_0(X1,X2))).
% 0.15/0.41 cnf(i_0_8, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1))).
% 0.15/0.41 cnf(i_0_25, plain, (~v1_xboole_0(esk8_0))).
% 0.15/0.41 cnf(i_0_3, negated_conjecture, (~r2_hidden(esk1_0,esk4_0)|~r2_hidden(esk2_0,esk4_0))).
% 0.15/0.41 cnf(i_0_1, negated_conjecture, (~r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0))|~r2_hidden(esk1_0,esk4_0))).
% 0.15/0.41 cnf(i_0_2, negated_conjecture, (~r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))|~r2_hidden(esk2_0,esk4_0))).
% 0.15/0.41 cnf(i_0_33, plain, (~v1_xboole_0(X1)|~r2_hidden(X2,X1))).
% 0.15/0.41 cnf(i_0_32, plain, (X1=k1_xboole_0|~v1_xboole_0(X1))).
% 0.15/0.41 cnf(i_0_7, plain, (~r2_hidden(X1,X2)|~r2_hidden(X2,X1))).
% 0.15/0.41 cnf(i_0_4, negated_conjecture, (~r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))|~r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)))).
% 0.15/0.41 cnf(i_0_34, plain, (X1=X2|~v1_xboole_0(X2)|~v1_xboole_0(X1))).
% 0.15/0.41 cnf(i_0_22, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X2,X1)))).
% 0.15/0.41 cnf(i_0_21, plain, (v1_xboole_0(X1)|~v1_xboole_0(k2_xboole_0(X1,X2)))).
% 0.15/0.41 cnf(i_0_27, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2))).
% 0.15/0.41 cnf(i_0_28, plain, (v1_xboole_0(X1)|r2_hidden(X2,X1)|~m1_subset_1(X2,X1))).
% 0.15/0.41 cnf(i_0_12, plain, (r2_hidden(X1,k2_xboole_0(X2,X3))|~r2_hidden(X1,X3))).
% 0.15/0.41 cnf(i_0_13, plain, (r2_hidden(X1,k2_xboole_0(X2,X3))|~r2_hidden(X1,X2))).
% 0.15/0.41 cnf(i_0_14, plain, (r2_hidden(X1,X2)|r2_hidden(X1,X3)|~r2_hidden(X1,k2_xboole_0(X3,X2)))).
% 0.15/0.41 cnf(i_0_10, plain, (X1=k2_xboole_0(X2,X3)|~r2_hidden(esk5_3(X2,X3,X1),X1)|~r2_hidden(esk5_3(X2,X3,X1),X3))).
% 0.15/0.41 cnf(i_0_11, plain, (X1=k2_xboole_0(X2,X3)|~r2_hidden(esk5_3(X2,X3,X1),X1)|~r2_hidden(esk5_3(X2,X3,X1),X2))).
% 0.15/0.41 cnf(i_0_9, plain, (X1=k2_xboole_0(X2,X3)|r2_hidden(esk5_3(X2,X3,X1),X2)|r2_hidden(esk5_3(X2,X3,X1),X3)|r2_hidden(esk5_3(X2,X3,X1),X1))).
% 0.15/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.41 # Begin printing tableau
% 0.15/0.41 # Found 4 steps
% 0.15/0.41 cnf(i_0_5, negated_conjecture, (r2_hidden(esk2_0,k2_xboole_0(esk4_0,esk3_0))), inference(start_rule)).
% 0.15/0.41 cnf(i_0_47, plain, (r2_hidden(esk2_0,k2_xboole_0(esk4_0,esk3_0))), inference(extension_rule, [i_0_33])).
% 0.15/0.41 cnf(i_0_177, plain, (~v1_xboole_0(k2_xboole_0(esk4_0,esk3_0))), inference(extension_rule, [i_0_22])).
% 0.15/0.41 cnf(i_0_187, plain, (~v1_xboole_0(k2_xboole_0(X4,k2_xboole_0(esk4_0,esk3_0)))), inference(etableau_closure_rule, [i_0_187, ...])).
% 0.15/0.41 # End printing tableau
% 0.15/0.41 # SZS output end
% 0.15/0.41 # Branches closed with saturation will be marked with an "s"
% 0.15/0.41 # Child (29671) has found a proof.
% 0.15/0.41
% 0.15/0.41 # Proof search is over...
% 0.15/0.41 # Freeing feature tree
%------------------------------------------------------------------------------