TSTP Solution File: SET974+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET974+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 : n010.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:12 EDT 2022
% Result : Theorem 0.18s 0.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET974+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % 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 : n010.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 14:56:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.37 #
% 0.18/0.37 # Presaturation interreduction done
% 0.18/0.37 # Number of axioms: 15 Number of unprocessed: 15
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 15 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 2 conjectures.
% 0.18/0.37 # There are 2 start rule candidates:
% 0.18/0.37 # Found 7 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 2 start rule tableaux created.
% 0.18/0.37 # 8 extension rule candidate clauses
% 0.18/0.37 # 7 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 0.18/0.37 # There were 2 total branch saturation attempts.
% 0.18/0.37 # There were 0 of these attempts blocked.
% 0.18/0.37 # There were 0 deferred branch saturation attempts.
% 0.18/0.37 # There were 1 free duplicated saturations.
% 0.18/0.37 # There were 2 total successful branch saturations.
% 0.18/0.37 # There were 0 successful branch saturations in interreduction.
% 0.18/0.37 # There were 0 successful branch saturations on the branch.
% 0.18/0.37 # There were 1 successful branch saturations after the branch.
% 0.18/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.37 # Begin clausification derivation
% 0.18/0.37
% 0.18/0.37 # End clausification derivation
% 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.37 cnf(i_0_7, plain, (empty(esk1_0))).
% 0.18/0.37 cnf(i_0_6, plain, (set_intersection2(X1,X1)=X1)).
% 0.18/0.37 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.18/0.37 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))).
% 0.18/0.37 cnf(i_0_13, negated_conjecture, (~disjoint(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0)))).
% 0.18/0.37 cnf(i_0_8, plain, (~empty(esk2_0))).
% 0.18/0.37 cnf(i_0_5, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.18/0.37 cnf(i_0_14, negated_conjecture, (disjoint(esk7_0,esk8_0)|disjoint(esk5_0,esk6_0))).
% 0.18/0.37 cnf(i_0_9, plain, (disjoint(X1,X2)|~disjoint(X2,X1))).
% 0.18/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.18/0.37 cnf(i_0_15, plain, (~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2)))).
% 0.18/0.37 cnf(i_0_16, plain, (disjoint(X1,X2)|in(esk9_2(X1,X2),set_intersection2(X1,X2)))).
% 0.18/0.37 cnf(i_0_11, plain, (in(esk3_5(X1,X2,X3,X4,X5),set_intersection2(X2,X4))|~in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))))).
% 0.18/0.37 cnf(i_0_10, plain, (in(esk4_5(X1,X2,X3,X4,X5),set_intersection2(X3,X5))|~in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))))).
% 0.18/0.37 cnf(i_0_12, plain, (unordered_pair(singleton(esk3_5(X1,X2,X3,X4,X5)),unordered_pair(esk3_5(X1,X2,X3,X4,X5),esk4_5(X1,X2,X3,X4,X5)))=X1|~in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))))).
% 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.37 # Begin printing tableau
% 0.18/0.37 # Found 4 steps
% 0.18/0.37 cnf(i_0_13, negated_conjecture, (~disjoint(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0))), inference(start_rule)).
% 0.18/0.37 cnf(i_0_19, plain, (~disjoint(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0))), inference(extension_rule, [i_0_16])).
% 0.18/0.37 cnf(i_0_59, plain, (in(esk9_2(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0)),set_intersection2(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0)))), inference(extension_rule, [i_0_1])).
% 0.18/0.37 cnf(i_0_70, plain, (~in(set_intersection2(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0)),esk9_2(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0)))), inference(etableau_closure_rule, [i_0_70, ...])).
% 0.18/0.37 # End printing tableau
% 0.18/0.37 # SZS output end
% 0.18/0.37 # Branches closed with saturation will be marked with an "s"
% 0.18/0.37 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.37 # We now have 7 tableaux to operate on
% 0.18/0.37 # Found closed tableau during pool population.
% 0.18/0.37 # Proof search is over...
% 0.18/0.37 # Freeing feature tree
%------------------------------------------------------------------------------