TSTP Solution File: SEU137+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU137+1 : TPTP v8.1.0. Released v3.3.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 : n029.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:24:04 EDT 2022
% Result : Theorem 1.73s 2.10s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU137+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/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.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 22:43:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.12/0.37 # and selection function SelectCQArNTNpEqFirst.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 34 Number of unprocessed: 34
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.69/0.91 # The folding up rule is enabled...
% 0.69/0.91 # Local unification is enabled...
% 0.69/0.91 # Any saturation attempts will use folding labels...
% 0.69/0.91 # 34 beginning clauses after preprocessing and clausification
% 0.69/0.91 # Creating start rules for all 2 conjectures.
% 0.69/0.91 # There are 2 start rule candidates:
% 0.69/0.91 # Found 11 unit axioms.
% 0.69/0.91 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.69/0.91 # 2 start rule tableaux created.
% 0.69/0.91 # 23 extension rule candidate clauses
% 0.69/0.91 # 11 unit axiom clauses
% 0.69/0.91
% 0.69/0.91 # Requested 8, 32 cores available to the main process.
% 0.69/0.91 # There are not enough tableaux to fork, creating more from the initial 2
% 1.69/1.89 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 1.69/1.89 # We now have 24 tableaux to operate on
% 1.73/2.10 # There were 7 total branch saturation attempts.
% 1.73/2.10 # There were 1 of these attempts blocked.
% 1.73/2.10 # There were 0 deferred branch saturation attempts.
% 1.73/2.10 # There were 0 free duplicated saturations.
% 1.73/2.10 # There were 3 total successful branch saturations.
% 1.73/2.10 # There were 0 successful branch saturations in interreduction.
% 1.73/2.10 # There were 0 successful branch saturations on the branch.
% 1.73/2.10 # There were 3 successful branch saturations after the branch.
% 1.73/2.10 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.73/2.10 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.73/2.10 # Begin clausification derivation
% 1.73/2.10
% 1.73/2.10 # End clausification derivation
% 1.73/2.10 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.73/2.10 cnf(i_0_33, negated_conjecture, (subset(esk7_0,esk8_0))).
% 1.73/2.10 cnf(i_0_21, plain, (empty(empty_set))).
% 1.73/2.10 cnf(i_0_25, plain, (empty(esk4_0))).
% 1.73/2.10 cnf(i_0_27, plain, (subset(X1,X1))).
% 1.73/2.10 cnf(i_0_34, plain, (set_difference(empty_set,X1)=empty_set)).
% 1.73/2.10 cnf(i_0_28, plain, (set_union2(X1,empty_set)=X1)).
% 1.73/2.10 cnf(i_0_31, plain, (set_difference(X1,empty_set)=X1)).
% 1.73/2.10 cnf(i_0_24, plain, (set_union2(X1,X1)=X1)).
% 1.73/2.10 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 1.73/2.10 cnf(i_0_32, negated_conjecture, (set_union2(esk7_0,set_difference(esk8_0,esk7_0))!=esk8_0)).
% 1.73/2.10 cnf(i_0_26, plain, (~empty(esk5_0))).
% 1.73/2.10 cnf(i_0_35, plain, (X1=empty_set|~empty(X1))).
% 1.73/2.10 cnf(i_0_36, plain, (~empty(X1)|~in(X2,X1))).
% 1.73/2.10 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 1.73/2.10 cnf(i_0_23, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 1.73/2.10 cnf(i_0_22, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 1.73/2.10 cnf(i_0_37, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 1.73/2.10 cnf(i_0_10, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))).
% 1.73/2.10 cnf(i_0_11, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 1.73/2.10 cnf(i_0_16, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))).
% 1.73/2.10 cnf(i_0_9, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))).
% 1.73/2.10 cnf(i_0_6, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))).
% 1.73/2.10 cnf(i_0_7, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))).
% 1.73/2.10 cnf(i_0_17, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))).
% 1.73/2.10 cnf(i_0_29, plain, (X1=X2|in(esk6_2(X1,X2),X1)|in(esk6_2(X1,X2),X2))).
% 1.73/2.10 cnf(i_0_30, plain, (X1=X2|~in(esk6_2(X1,X2),X2)|~in(esk6_2(X1,X2),X1))).
% 1.73/2.10 cnf(i_0_15, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))).
% 1.73/2.10 cnf(i_0_8, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))).
% 1.73/2.10 cnf(i_0_4, plain, (X1=set_union2(X2,X3)|~in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X3))).
% 1.73/2.10 cnf(i_0_5, plain, (X1=set_union2(X2,X3)|~in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X2))).
% 1.73/2.10 cnf(i_0_12, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3))).
% 1.73/2.10 cnf(i_0_13, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X1))).
% 1.73/2.10 cnf(i_0_3, plain, (X1=set_union2(X2,X3)|in(esk1_3(X2,X3,X1),X2)|in(esk1_3(X2,X3,X1),X3)|in(esk1_3(X2,X3,X1),X1))).
% 1.73/2.10 cnf(i_0_14, plain, (X1=set_difference(X2,X3)|in(esk3_3(X2,X3,X1),X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X2))).
% 1.73/2.10 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.73/2.10 # Begin printing tableau
% 1.73/2.10 # Found 11 steps
% 1.73/2.10 cnf(i_0_33, negated_conjecture, (subset(esk7_0,esk8_0)), inference(start_rule)).
% 1.73/2.10 cnf(i_0_45, plain, (subset(esk7_0,esk8_0)), inference(extension_rule, [i_0_11])).
% 1.73/2.10 cnf(i_0_121, plain, (in(esk6_2(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk8_0),esk8_0)), inference(extension_rule, [i_0_6])).
% 1.73/2.10 cnf(i_0_188, plain, (in(esk6_2(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk8_0),set_union2(X8,esk8_0))), inference(extension_rule, [i_0_36])).
% 1.73/2.10 cnf(i_0_123, plain, (~in(esk6_2(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk8_0),esk7_0)), inference(extension_rule, [i_0_15])).
% 1.73/2.10 cnf(i_0_126544, plain, (in(esk6_2(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk8_0),set_difference(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk7_0))), inference(extension_rule, [i_0_1])).
% 1.73/2.10 cnf(i_0_126546, plain, (~in(esk6_2(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk8_0),set_union2(esk7_0,set_difference(esk8_0,esk7_0)))), inference(extension_rule, [i_0_29])).
% 1.73/2.10 cnf(i_0_126894, plain, (set_union2(esk7_0,set_difference(esk8_0,esk7_0))=esk8_0), inference(closure_rule, [i_0_32])).
% 1.73/2.10 cnf(i_0_125841, plain, (~empty(set_union2(X8,esk8_0))), inference(etableau_closure_rule, [i_0_125841, ...])).
% 1.73/2.10 cnf(i_0_126550, plain, (~in(set_difference(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk7_0),esk6_2(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk8_0))), inference(etableau_closure_rule, [i_0_126550, ...])).
% 1.73/2.10 cnf(i_0_126896, plain, (in(esk6_2(set_union2(esk7_0,set_difference(esk8_0,esk7_0)),esk8_0),esk8_0)), inference(etableau_closure_rule, [i_0_126896, ...])).
% 1.73/2.10 # End printing tableau
% 1.73/2.10 # SZS output end
% 1.73/2.10 # Branches closed with saturation will be marked with an "s"
% 1.73/2.11 # Child (26222) has found a proof.
% 1.73/2.11
% 1.73/2.11 # Proof search is over...
% 1.73/2.11 # Freeing feature tree
%------------------------------------------------------------------------------