TSTP Solution File: SET608+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET608+3 : TPTP v8.1.0. Released v2.2.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 : Tue Jul 19 01:01:16 EDT 2022
% Result : Theorem 15.90s 4.86s
% Output : CNFRefutation 15.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET608+3 : TPTP v8.1.0. Released v2.2.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 : Sun Jul 10 07:28:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
% 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 21 Number of unprocessed: 19
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 19 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 1 conjectures.
% 0.13/0.38 # There are 1 start rule candidates:
% 0.13/0.38 # Found 4 unit axioms.
% 0.13/0.38 # 1 start rule tableaux created.
% 0.13/0.38 # 15 extension rule candidate clauses
% 0.13/0.38 # 4 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 3.04/3.23 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 3.04/3.23 # We now have 9 tableaux to operate on
% 15.90/4.86 # There were 14 total branch saturation attempts.
% 15.90/4.86 # There were 1 of these attempts blocked.
% 15.90/4.86 # There were 0 deferred branch saturation attempts.
% 15.90/4.86 # There were 6 free duplicated saturations.
% 15.90/4.86 # There were 8 total successful branch saturations.
% 15.90/4.86 # There were 0 successful branch saturations in interreduction.
% 15.90/4.86 # There were 0 successful branch saturations on the branch.
% 15.90/4.86 # There were 2 successful branch saturations after the branch.
% 15.90/4.86 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.90/4.86 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.90/4.86 # Begin clausification derivation
% 15.90/4.86
% 15.90/4.86 # End clausification derivation
% 15.90/4.86 # Begin listing active clauses obtained from FOF to CNF conversion
% 15.90/4.86 cnf(i_0_18, plain, (subset(X1,X1))).
% 15.90/4.86 cnf(i_0_13, plain, (union(X1,X2)=union(X2,X1))).
% 15.90/4.86 cnf(i_0_14, plain, (intersection(X1,X2)=intersection(X2,X1))).
% 15.90/4.86 cnf(i_0_23, negated_conjecture, (union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))!=esk3_0)).
% 15.90/4.86 cnf(i_0_16, plain, (subset(X1,X2)|member(esk1_2(X1,X2),X1))).
% 15.90/4.86 cnf(i_0_1, plain, (member(X1,union(X2,X3))|~member(X1,X3))).
% 15.90/4.86 cnf(i_0_2, plain, (member(X1,union(X2,X3))|~member(X1,X2))).
% 15.90/4.86 cnf(i_0_19, plain, (X1=X2|member(esk2_2(X1,X2),X1)|member(esk2_2(X1,X2),X2))).
% 15.90/4.86 cnf(i_0_8, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 15.90/4.86 cnf(i_0_5, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))).
% 15.90/4.86 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))).
% 15.90/4.86 cnf(i_0_9, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 15.90/4.86 cnf(i_0_15, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))).
% 15.90/4.86 cnf(i_0_10, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 15.90/4.86 cnf(i_0_17, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))).
% 15.90/4.86 cnf(i_0_7, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 15.90/4.86 cnf(i_0_3, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))).
% 15.90/4.86 cnf(i_0_4, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))).
% 15.90/4.86 cnf(i_0_20, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))).
% 15.90/4.86 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 15.90/4.86 # Begin printing tableau
% 15.90/4.86 # Found 17 steps
% 15.90/4.86 cnf(i_0_23, negated_conjecture, (union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))!=esk3_0), inference(start_rule)).
% 15.90/4.86 cnf(i_0_26, plain, (union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))!=esk3_0), inference(extension_rule, [i_0_20])).
% 15.90/4.86 cnf(i_0_62, plain, (~member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),esk3_0)), inference(extension_rule, [i_0_17])).
% 15.90/4.86 cnf(i_0_63, plain, (~member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)))), inference(etableau_closure_rule, [i_0_63, ...])).
% 15.90/4.86 cnf(i_0_396596, plain, (~subset(intersection(esk3_0,X10),esk3_0)), inference(extension_rule, [i_0_15])).
% 15.90/4.86 cnf(i_0_823450, plain, (~member(esk1_2(intersection(esk3_0,X10),esk3_0),esk3_0)), inference(extension_rule, [i_0_6])).
% 15.90/4.86 cnf(i_0_823463, plain, (~member(esk1_2(intersection(esk3_0,X10),esk3_0),intersection(esk3_0,X10))), inference(extension_rule, [i_0_16])).
% 15.90/4.86 cnf(i_0_823473, plain, (subset(intersection(esk3_0,X10),esk3_0)), inference(closure_rule, [i_0_396596])).
% 15.90/4.86 cnf(i_0_396597, plain, (~member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),intersection(esk3_0,X10))), inference(extension_rule, [i_0_9])).
% 15.90/4.86 cnf(i_0_823485, plain, (~member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),difference(intersection(esk3_0,X10),X8))), inference(extension_rule, [i_0_5])).
% 15.90/4.86 cnf(i_0_823496, plain, (~member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),intersection(X9,difference(intersection(esk3_0,X10),X8)))), inference(extension_rule, [i_0_3])).
% 15.90/4.86 cnf(i_0_823507, plain, (member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),intersection(X9,difference(intersection(esk3_0,X10),X8)))), inference(closure_rule, [i_0_823496])).
% 15.90/4.86 cnf(i_0_823508, plain, (~member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),union(intersection(X9,difference(intersection(esk3_0,X10),X8)),intersection(X9,difference(intersection(esk3_0,X10),X8))))), inference(extension_rule, [i_0_17])).
% 15.90/4.86 cnf(i_0_823522, plain, (~member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)))), inference(extension_rule, [i_0_19])).
% 15.90/4.86 cnf(i_0_823529, plain, (union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))=esk3_0), inference(closure_rule, [i_0_23])).
% 15.90/4.86 cnf(i_0_823531, plain, (member(esk2_2(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),esk3_0),esk3_0)), inference(closure_rule, [i_0_62])).
% 15.90/4.86 cnf(i_0_823521, plain, (~subset(union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),union(intersection(X9,difference(intersection(esk3_0,X10),X8)),intersection(X9,difference(intersection(esk3_0,X10),X8))))), inference(etableau_closure_rule, [i_0_823521, ...])).
% 15.90/4.86 # End printing tableau
% 15.90/4.86 # SZS output end
% 15.90/4.86 # Branches closed with saturation will be marked with an "s"
% 15.90/4.89 # Child (350) has found a proof.
% 15.90/4.89
% 15.90/4.89 # Proof search is over...
% 15.90/4.89 # Freeing feature tree
%------------------------------------------------------------------------------