TSTP Solution File: SET984+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET984+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 : 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:04:16 EDT 2022
% Result : Theorem 0.18s 0.39s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET984+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/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 : n011.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 06:34:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 17 Number of unprocessed: 17
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 17 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 3 conjectures.
% 0.18/0.36 # There are 3 start rule candidates:
% 0.18/0.36 # Found 12 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 3 start rule tableaux created.
% 0.18/0.36 # 5 extension rule candidate clauses
% 0.18/0.36 # 12 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 3
% 0.18/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 9 tableaux to operate on
% 0.18/0.39 # There were 1 total branch saturation attempts.
% 0.18/0.39 # There were 0 of these attempts blocked.
% 0.18/0.39 # There were 0 deferred branch saturation attempts.
% 0.18/0.39 # There were 0 free duplicated saturations.
% 0.18/0.39 # There were 1 total successful branch saturations.
% 0.18/0.39 # There were 0 successful branch saturations in interreduction.
% 0.18/0.39 # There were 0 successful branch saturations on the branch.
% 0.18/0.39 # There were 1 successful branch saturations after the branch.
% 0.18/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.39 # Begin clausification derivation
% 0.18/0.39
% 0.18/0.39 # End clausification derivation
% 0.18/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.39 cnf(i_0_2, plain, (empty(empty_set))).
% 0.18/0.39 cnf(i_0_15, negated_conjecture, (subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)))).
% 0.18/0.39 cnf(i_0_4, plain, (empty(esk1_0))).
% 0.18/0.39 cnf(i_0_6, plain, (subset(X1,X1))).
% 0.18/0.39 cnf(i_0_3, plain, (set_intersection2(X1,X1)=X1)).
% 0.18/0.39 cnf(i_0_16, plain, (subset(set_intersection2(X1,X2),X1))).
% 0.18/0.39 cnf(i_0_7, plain, (cartesian_product2(X1,empty_set)=empty_set)).
% 0.18/0.39 cnf(i_0_8, plain, (cartesian_product2(empty_set,X1)=empty_set)).
% 0.18/0.39 cnf(i_0_10, plain, (cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)))).
% 0.18/0.39 cnf(i_0_1, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.18/0.39 cnf(i_0_14, negated_conjecture, (cartesian_product2(esk3_0,esk4_0)!=empty_set)).
% 0.18/0.39 cnf(i_0_5, plain, (~empty(esk2_0))).
% 0.18/0.39 cnf(i_0_13, negated_conjecture, (~subset(esk3_0,esk5_0)|~subset(esk4_0,esk6_0))).
% 0.18/0.39 cnf(i_0_17, plain, (set_intersection2(X1,X2)=X1|~subset(X1,X2))).
% 0.18/0.39 cnf(i_0_9, plain, (X1=empty_set|X2=empty_set|cartesian_product2(X1,X2)!=empty_set)).
% 0.18/0.39 cnf(i_0_11, plain, (X1=empty_set|X2=empty_set|X1=X3|cartesian_product2(X2,X1)!=cartesian_product2(X4,X3))).
% 0.18/0.39 cnf(i_0_12, plain, (X1=empty_set|X2=empty_set|X1=X3|cartesian_product2(X1,X2)!=cartesian_product2(X3,X4))).
% 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.39 # Begin printing tableau
% 0.18/0.39 # Found 6 steps
% 0.18/0.39 cnf(i_0_14, negated_conjecture, (cartesian_product2(esk3_0,esk4_0)!=empty_set), inference(start_rule)).
% 0.18/0.39 cnf(i_0_22, plain, (cartesian_product2(esk3_0,esk4_0)!=empty_set), inference(extension_rule, [i_0_9])).
% 0.18/0.39 cnf(i_0_57, plain, (cartesian_product2(esk3_0,esk4_0)=empty_set), inference(closure_rule, [i_0_14])).
% 0.18/0.39 cnf(i_0_58, plain, (cartesian_product2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk3_0,esk4_0))!=empty_set), inference(extension_rule, [i_0_9])).
% 0.18/0.39 cnf(i_0_102, plain, (cartesian_product2(esk3_0,esk4_0)=empty_set), inference(closure_rule, [i_0_14])).
% 0.18/0.39 cnf(i_0_103, plain, (cartesian_product2(cartesian_product2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk3_0,esk4_0)),cartesian_product2(esk3_0,esk4_0))!=empty_set), inference(etableau_closure_rule, [i_0_103, ...])).
% 0.18/0.39 # End printing tableau
% 0.18/0.39 # SZS output end
% 0.18/0.39 # Branches closed with saturation will be marked with an "s"
% 0.18/0.39 # Child (432) has found a proof.
% 0.18/0.39
% 0.18/0.39 # Proof search is over...
% 0.18/0.39 # Freeing feature tree
%------------------------------------------------------------------------------