TSTP Solution File: SET914+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET914+1 : TPTP v8.1.0. Released v3.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 : n026.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:03:47 EDT 2022
% Result : Theorem 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET914+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 15:36:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 26 Number of unprocessed: 26
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 26 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 2 conjectures.
% 0.12/0.36 # There are 2 start rule candidates:
% 0.12/0.36 # Found 11 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 2 start rule tableaux created.
% 0.12/0.36 # 15 extension rule candidate clauses
% 0.12/0.36 # 11 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.36 # There were 2 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 2 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 2 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_25, negated_conjecture, (in(esk6_0,esk8_0))).
% 0.12/0.36 cnf(i_0_26, negated_conjecture, (disjoint(unordered_pair(esk6_0,esk7_0),esk8_0))).
% 0.12/0.36 cnf(i_0_20, plain, (empty(empty_set))).
% 0.12/0.36 cnf(i_0_22, plain, (empty(esk4_0))).
% 0.12/0.36 cnf(i_0_21, plain, (set_intersection2(X1,X1)=X1)).
% 0.12/0.36 cnf(i_0_9, plain, (in(X1,unordered_pair(X2,X1)))).
% 0.12/0.36 cnf(i_0_10, plain, (in(X1,unordered_pair(X1,X2)))).
% 0.12/0.36 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.12/0.36 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.12/0.36 cnf(i_0_23, plain, (~empty(esk5_0))).
% 0.12/0.36 cnf(i_0_5, plain, (~in(X1,empty_set))).
% 0.12/0.36 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.36 cnf(i_0_19, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))).
% 0.12/0.36 cnf(i_0_4, plain, (X1=empty_set|in(esk1_1(X1),X1))).
% 0.12/0.36 cnf(i_0_24, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 0.12/0.36 cnf(i_0_18, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)).
% 0.12/0.36 cnf(i_0_16, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))).
% 0.12/0.36 cnf(i_0_17, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))).
% 0.12/0.36 cnf(i_0_11, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))).
% 0.12/0.36 cnf(i_0_7, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X3|~in(esk2_3(X2,X3,X1),X1))).
% 0.12/0.36 cnf(i_0_8, plain, (X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)!=X2|~in(esk2_3(X2,X3,X1),X1))).
% 0.12/0.36 cnf(i_0_15, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))).
% 0.12/0.36 cnf(i_0_14, plain, (X1=set_intersection2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3)|~in(esk3_3(X2,X3,X1),X2))).
% 0.12/0.36 cnf(i_0_12, plain, (X1=set_intersection2(X2,X3)|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X1))).
% 0.12/0.36 cnf(i_0_13, plain, (X1=set_intersection2(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X1))).
% 0.12/0.36 cnf(i_0_6, plain, (esk2_3(X1,X2,X3)=X1|esk2_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk2_3(X1,X2,X3),X3))).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 5 steps
% 0.12/0.36 cnf(i_0_25, negated_conjecture, (in(esk6_0,esk8_0)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_37, plain, (in(esk6_0,esk8_0)), inference(extension_rule, [i_0_15])).
% 0.12/0.36 cnf(i_0_102, plain, (~in(esk6_0,unordered_pair(X6,esk6_0))), inference(closure_rule, [i_0_9])).
% 0.12/0.36 cnf(i_0_101, plain, (in(esk6_0,set_intersection2(esk8_0,unordered_pair(X6,esk6_0)))), inference(extension_rule, [i_0_1])).
% 0.12/0.36 cnf(i_0_118, plain, (~in(set_intersection2(esk8_0,unordered_pair(X6,esk6_0)),esk6_0)), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 7 tableaux to operate on
% 0.12/0.36 # Found closed tableau during pool population.
% 0.12/0.36 # Proof search is over...
% 0.12/0.36 # Freeing feature tree
%------------------------------------------------------------------------------