TSTP Solution File: SEU138+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU138+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 : n020.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:05 EDT 2022
% Result : Theorem 6.69s 1.30s
% Output : CNFRefutation 6.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU138+1 : TPTP v8.1.0. Released v3.3.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.16/0.37 % Computer : n020.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Sun Jun 19 07:31:48 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.16/0.40 # No SInE strategy applied
% 0.16/0.40 # Auto-Mode selected heuristic G_E___300_C01_F1_SE_CS_SP_S0Y
% 0.16/0.40 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.16/0.40 #
% 0.16/0.40 # Number of axioms: 32 Number of unprocessed: 32
% 0.16/0.40 # Tableaux proof search.
% 0.16/0.40 # APR header successfully linked.
% 0.16/0.40 # Hello from C++
% 0.16/0.40 # The folding up rule is enabled...
% 0.16/0.40 # Local unification is enabled...
% 0.16/0.40 # Any saturation attempts will use folding labels...
% 0.16/0.40 # 32 beginning clauses after preprocessing and clausification
% 0.16/0.40 # Creating start rules for all 1 conjectures.
% 0.16/0.40 # There are 1 start rule candidates:
% 0.16/0.40 # Found 10 unit axioms.
% 0.16/0.40 # 1 start rule tableaux created.
% 0.16/0.40 # 22 extension rule candidate clauses
% 0.16/0.40 # 10 unit axiom clauses
% 0.16/0.40
% 0.16/0.40 # Requested 8, 32 cores available to the main process.
% 0.16/0.40 # There are not enough tableaux to fork, creating more from the initial 1
% 0.16/0.40 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.16/0.40 # We now have 8 tableaux to operate on
% 4.36/0.98 # Creating equality axioms
% 4.36/0.98 # Ran out of tableaux, making start rules for all clauses
% 6.69/1.30 # There were 6 total branch saturation attempts.
% 6.69/1.30 # There were 0 of these attempts blocked.
% 6.69/1.30 # There were 0 deferred branch saturation attempts.
% 6.69/1.30 # There were 0 free duplicated saturations.
% 6.69/1.30 # There were 5 total successful branch saturations.
% 6.69/1.30 # There were 1 successful branch saturations in interreduction.
% 6.69/1.30 # There were 0 successful branch saturations on the branch.
% 6.69/1.30 # There were 4 successful branch saturations after the branch.
% 6.69/1.30 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.69/1.30 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.69/1.30 # Begin clausification derivation
% 6.69/1.30
% 6.69/1.30 # End clausification derivation
% 6.69/1.30 # Begin listing active clauses obtained from FOF to CNF conversion
% 6.69/1.30 cnf(i_0_24, plain, (empty(empty_set))).
% 6.69/1.30 cnf(i_0_26, plain, (empty(esk4_0))).
% 6.69/1.30 cnf(i_0_27, plain, (~empty(esk5_0))).
% 6.69/1.30 cnf(i_0_33, plain, (X1=empty_set|~empty(X1))).
% 6.69/1.30 cnf(i_0_29, plain, (set_intersection2(X1,empty_set)=empty_set)).
% 6.69/1.30 cnf(i_0_32, plain, (set_difference(empty_set,X1)=empty_set)).
% 6.69/1.30 cnf(i_0_30, plain, (set_difference(X1,empty_set)=X1)).
% 6.69/1.30 cnf(i_0_28, plain, (subset(X1,X1))).
% 6.69/1.30 cnf(i_0_25, plain, (set_intersection2(X1,X1)=X1)).
% 6.69/1.30 cnf(i_0_35, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 6.69/1.30 cnf(i_0_4, plain, (subset(X1,X2)|X1!=X2)).
% 6.69/1.30 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)).
% 6.69/1.30 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 6.69/1.30 cnf(i_0_34, plain, (~empty(X2)|~in(X1,X2))).
% 6.69/1.30 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 6.69/1.30 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 6.69/1.30 cnf(i_0_7, plain, (subset(X1,X2)|in(esk1_2(X1,X2),X1))).
% 6.69/1.30 cnf(i_0_8, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 6.69/1.30 cnf(i_0_13, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))).
% 6.69/1.30 cnf(i_0_14, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))).
% 6.69/1.30 cnf(i_0_20, plain, (in(X1,X2)|X3!=set_difference(X2,X4)|~in(X1,X3))).
% 6.69/1.30 cnf(i_0_31, negated_conjecture, (set_difference(esk6_0,set_difference(esk6_0,esk7_0))!=set_intersection2(esk6_0,esk7_0))).
% 6.69/1.30 cnf(i_0_19, plain, (X3!=set_difference(X4,X2)|~in(X1,X3)|~in(X1,X2))).
% 6.69/1.30 cnf(i_0_18, plain, (in(X1,X4)|in(X1,X3)|X4!=set_difference(X2,X3)|~in(X1,X2))).
% 6.69/1.30 cnf(i_0_6, plain, (subset(X1,X2)|~in(esk1_2(X1,X2),X2))).
% 6.69/1.30 cnf(i_0_12, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))).
% 6.69/1.30 cnf(i_0_9, plain, (X3=set_intersection2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2))).
% 6.69/1.30 cnf(i_0_10, plain, (X3=set_intersection2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X1))).
% 6.69/1.30 cnf(i_0_16, plain, (X3=set_difference(X1,X2)|in(esk3_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X1))).
% 6.69/1.30 cnf(i_0_15, plain, (X3=set_difference(X1,X2)|in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X2))).
% 6.69/1.30 cnf(i_0_17, plain, (X3=set_difference(X1,X2)|in(esk3_3(X1,X2,X3),X2)|~in(esk3_3(X1,X2,X3),X3)|~in(esk3_3(X1,X2,X3),X1))).
% 6.69/1.30 cnf(i_0_11, plain, (X3=set_intersection2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2)|~in(esk2_3(X1,X2,X3),X1))).
% 6.69/1.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 6.69/1.30 # Begin printing tableau
% 6.69/1.30 # Found 12 steps
% 6.69/1.30 cnf(i_0_31, negated_conjecture, (set_difference(esk6_0,set_difference(esk6_0,esk7_0))!=set_intersection2(esk6_0,esk7_0)), inference(start_rule)).
% 6.69/1.30 cnf(i_0_36, plain, (set_difference(esk6_0,set_difference(esk6_0,esk7_0))!=set_intersection2(esk6_0,esk7_0)), inference(extension_rule, [i_0_17])).
% 6.69/1.30 cnf(i_0_95, plain, (~in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk6_0)), inference(extension_rule, [i_0_8])).
% 6.69/1.30 cnf(i_0_102478, plain, (~in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),esk6_0)), inference(extension_rule, [i_0_16])).
% 6.69/1.30 cnf(i_0_102524, plain, (set_difference(esk6_0,set_difference(esk6_0,esk7_0))=set_intersection2(esk6_0,esk7_0)), inference(closure_rule, [i_0_31])).
% 6.69/1.30 cnf(i_0_102479, plain, (~subset(esk6_0,esk6_0)), inference(extension_rule, [i_0_4])).
% 6.69/1.30 cnf(i_0_94, plain, (~in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(extension_rule, [i_0_13])).
% 6.69/1.30 cnf(i_0_102549, plain, (set_difference(set_intersection2(X9,set_intersection2(esk6_0,esk7_0)),empty_set)!=set_intersection2(X9,set_intersection2(esk6_0,esk7_0))), inference(closure_rule, [i_0_30])).
% 6.69/1.30 cnf(i_0_93, plain, (in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(esk6_0,esk7_0))), inference(etableau_closure_rule, [i_0_93, ...])).
% 6.69/1.30 cnf(i_0_102525, plain, (in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0))), inference(etableau_closure_rule, [i_0_102525, ...])).
% 6.69/1.30 cnf(i_0_102533, plain, ($false), inference(etableau_closure_rule, [i_0_102533, ...])).
% 6.69/1.30 cnf(i_0_102550, plain, (~in(esk3_3(esk6_0,set_difference(esk6_0,esk7_0),set_intersection2(esk6_0,esk7_0)),set_difference(set_intersection2(X9,set_intersection2(esk6_0,esk7_0)),empty_set))), inference(etableau_closure_rule, [i_0_102550, ...])).
% 6.69/1.30 # End printing tableau
% 6.69/1.30 # SZS output end
% 6.69/1.30 # Branches closed with saturation will be marked with an "s"
% 6.69/1.30 # Child (21425) has found a proof.
% 6.69/1.30
% 6.69/1.30 # Proof search is over...
% 6.69/1.30 # Freeing feature tree
%------------------------------------------------------------------------------