TSTP Solution File: SET610+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET610+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 : n011.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:18 EDT 2022
% Result : Theorem 1.07s 1.27s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET610+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 15:53:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
% 0.14/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 19 Number of unprocessed: 17
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 17 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 1 conjectures.
% 0.14/0.38 # There are 1 start rule candidates:
% 0.14/0.38 # Found 3 unit axioms.
% 0.14/0.38 # 1 start rule tableaux created.
% 0.14/0.38 # 14 extension rule candidate clauses
% 0.14/0.38 # 3 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 1.07/1.27 # There were 6 total branch saturation attempts.
% 1.07/1.27 # There were 0 of these attempts blocked.
% 1.07/1.27 # There were 0 deferred branch saturation attempts.
% 1.07/1.27 # There were 2 free duplicated saturations.
% 1.07/1.27 # There were 5 total successful branch saturations.
% 1.07/1.27 # There were 0 successful branch saturations in interreduction.
% 1.07/1.27 # There were 0 successful branch saturations on the branch.
% 1.07/1.27 # There were 3 successful branch saturations after the branch.
% 1.07/1.27 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.07/1.27 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.07/1.27 # Begin clausification derivation
% 1.07/1.27
% 1.07/1.27 # End clausification derivation
% 1.07/1.27 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.07/1.27 cnf(i_0_20, plain, (subset(X1,X1))).
% 1.07/1.27 cnf(i_0_12, plain, (union(X1,X2)=union(X2,X1))).
% 1.07/1.27 cnf(i_0_21, negated_conjecture, (difference(union(esk5_0,esk4_0),esk5_0)!=difference(esk4_0,esk5_0))).
% 1.07/1.27 cnf(i_0_18, plain, (subset(X1,X2)|member(esk3_2(X1,X2),X1))).
% 1.07/1.27 cnf(i_0_3, plain, (member(X1,union(X2,X3))|~member(X1,X3))).
% 1.07/1.27 cnf(i_0_4, plain, (member(X1,union(X2,X3))|~member(X1,X2))).
% 1.07/1.27 cnf(i_0_1, plain, (X1=X2|member(esk1_2(X1,X2),X1)|member(esk1_2(X1,X2),X2))).
% 1.07/1.27 cnf(i_0_7, plain, (~member(X1,difference(X2,X3))|~member(X1,X3))).
% 1.07/1.27 cnf(i_0_8, plain, (member(X1,X2)|~member(X1,difference(X2,X3)))).
% 1.07/1.27 cnf(i_0_17, plain, (subset(X1,X2)|~member(esk3_2(X1,X2),X2))).
% 1.07/1.27 cnf(i_0_6, plain, (member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2))).
% 1.07/1.27 cnf(i_0_5, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))).
% 1.07/1.27 cnf(i_0_9, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))).
% 1.07/1.27 cnf(i_0_19, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))).
% 1.07/1.27 cnf(i_0_13, plain, (X1=X2|member(esk2_2(X1,X2),X1)|member(esk2_2(X1,X2),X2))).
% 1.07/1.27 cnf(i_0_2, plain, (X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1))).
% 1.07/1.27 cnf(i_0_14, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))).
% 1.07/1.27 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.07/1.27 # Begin printing tableau
% 1.07/1.27 # Found 6 steps
% 1.07/1.27 cnf(i_0_21, negated_conjecture, (difference(union(esk5_0,esk4_0),esk5_0)!=difference(esk4_0,esk5_0)), inference(start_rule)).
% 1.07/1.27 cnf(i_0_24, plain, (difference(union(esk5_0,esk4_0),esk5_0)!=difference(esk4_0,esk5_0)), inference(extension_rule, [i_0_14])).
% 1.07/1.27 cnf(i_0_59, plain, (~member(esk2_2(difference(union(esk5_0,esk4_0),esk5_0),difference(esk4_0,esk5_0)),difference(esk4_0,esk5_0))), inference(extension_rule, [i_0_6])).
% 1.07/1.27 cnf(i_0_60, plain, (~member(esk2_2(difference(union(esk5_0,esk4_0),esk5_0),difference(esk4_0,esk5_0)),difference(union(esk5_0,esk4_0),esk5_0))), inference(etableau_closure_rule, [i_0_60, ...])).
% 1.07/1.27 cnf(i_0_160273, plain, (member(esk2_2(difference(union(esk5_0,esk4_0),esk5_0),difference(esk4_0,esk5_0)),esk5_0)), inference(etableau_closure_rule, [i_0_160273, ...])).
% 1.07/1.27 cnf(i_0_160274, plain, (~member(esk2_2(difference(union(esk5_0,esk4_0),esk5_0),difference(esk4_0,esk5_0)),esk4_0)), inference(etableau_closure_rule, [i_0_160274, ...])).
% 1.07/1.27 # End printing tableau
% 1.07/1.27 # SZS output end
% 1.07/1.27 # Branches closed with saturation will be marked with an "s"
% 1.07/1.27 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 1.07/1.27 # We now have 7 tableaux to operate on
% 1.07/1.27 # Found closed tableau during pool population.
% 1.07/1.27 # Proof search is over...
% 1.07/1.27 # Freeing feature tree
%------------------------------------------------------------------------------