TSTP Solution File: SET894+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SET894+1 : TPTP v8.1.0. Bugfixed v4.0.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:03:39 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET894+1 : TPTP v8.1.0. Bugfixed v4.0.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.14/0.33 % Computer : n010.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sun Jul 10 16:39:45 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.20/0.36 # No SInE strategy applied
% 0.20/0.36 # Auto-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.36 #
% 0.20/0.36 # Presaturation interreduction done
% 0.20/0.36 # Number of axioms: 23 Number of unprocessed: 22
% 0.20/0.36 # Tableaux proof search.
% 0.20/0.36 # APR header successfully linked.
% 0.20/0.36 # Hello from C++
% 0.20/0.36 # The folding up rule is enabled...
% 0.20/0.36 # Local unification is enabled...
% 0.20/0.36 # Any saturation attempts will use folding labels...
% 0.20/0.36 # 22 beginning clauses after preprocessing and clausification
% 0.20/0.36 # Creating start rules for all 1 conjectures.
% 0.20/0.36 # There are 1 start rule candidates:
% 0.20/0.36 # Found 6 unit axioms.
% 0.20/0.36 # 1 start rule tableaux created.
% 0.20/0.36 # 16 extension rule candidate clauses
% 0.20/0.36 # 6 unit axiom clauses
% 0.20/0.36
% 0.20/0.36 # Requested 8, 32 cores available to the main process.
% 0.20/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.36 # We now have 9 tableaux to operate on
% 0.20/0.38 # There were 2 total branch saturation attempts.
% 0.20/0.38 # There were 0 of these attempts blocked.
% 0.20/0.38 # There were 0 deferred branch saturation attempts.
% 0.20/0.38 # There were 0 free duplicated saturations.
% 0.20/0.38 # There were 2 total successful branch saturations.
% 0.20/0.38 # There were 0 successful branch saturations in interreduction.
% 0.20/0.38 # There were 0 successful branch saturations on the branch.
% 0.20/0.38 # There were 2 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # Begin clausification derivation
% 0.20/0.38
% 0.20/0.38 # End clausification derivation
% 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.38 cnf(i_0_20, plain, (empty(esk7_0))).
% 0.20/0.38 cnf(i_0_5, plain, (in(X1,singleton(X1)))).
% 0.20/0.38 cnf(i_0_2, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.20/0.38 cnf(i_0_21, plain, (~empty(esk8_0))).
% 0.20/0.38 cnf(i_0_16, plain, (~empty(unordered_pair(singleton(X1),unordered_pair(X1,X2))))).
% 0.20/0.38 cnf(i_0_24, negated_conjecture, (singleton(unordered_pair(singleton(esk10_0),unordered_pair(esk10_0,esk11_0)))!=cartesian_product2(singleton(esk10_0),singleton(esk11_0)))).
% 0.20/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.20/0.38 cnf(i_0_6, plain, (X1=X2|~in(X1,singleton(X2)))).
% 0.20/0.38 cnf(i_0_4, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))).
% 0.20/0.38 cnf(i_0_18, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))).
% 0.20/0.38 cnf(i_0_19, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))).
% 0.20/0.38 cnf(i_0_23, plain, (X1=X2|~in(esk9_2(X1,X2),X2)|~in(esk9_2(X1,X2),X1))).
% 0.20/0.38 cnf(i_0_3, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))).
% 0.20/0.38 cnf(i_0_14, plain, (in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X1)|~in(X3,cartesian_product2(X1,X2)))).
% 0.20/0.38 cnf(i_0_13, plain, (in(esk3_4(X1,X2,cartesian_product2(X1,X2),X3),X2)|~in(X3,cartesian_product2(X1,X2)))).
% 0.20/0.38 cnf(i_0_22, plain, (X1=X2|in(esk9_2(X1,X2),X1)|in(esk9_2(X1,X2),X2))).
% 0.20/0.38 cnf(i_0_9, plain, (X1=cartesian_product2(X2,X3)|in(esk5_3(X2,X3,X1),X2)|in(esk4_3(X2,X3,X1),X1))).
% 0.20/0.38 cnf(i_0_17, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))).
% 0.20/0.38 cnf(i_0_8, plain, (X1=cartesian_product2(X2,X3)|in(esk6_3(X2,X3,X1),X3)|in(esk4_3(X2,X3,X1),X1))).
% 0.20/0.38 cnf(i_0_10, plain, (X1=cartesian_product2(X2,X3)|esk4_3(X2,X3,X1)!=unordered_pair(singleton(X4),unordered_pair(X4,X5))|~in(esk4_3(X2,X3,X1),X1)|~in(X5,X3)|~in(X4,X2))).
% 0.20/0.38 cnf(i_0_7, plain, (unordered_pair(singleton(esk5_3(X1,X2,X3)),unordered_pair(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)))=esk4_3(X1,X2,X3)|X3=cartesian_product2(X1,X2)|in(esk4_3(X1,X2,X3),X3))).
% 0.20/0.38 cnf(i_0_12, plain, (unordered_pair(singleton(esk2_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),esk3_4(X1,X2,cartesian_product2(X1,X2),X3)))=X3|~in(X3,cartesian_product2(X1,X2)))).
% 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.38 # Begin printing tableau
% 0.20/0.38 # Found 5 steps
% 0.20/0.38 cnf(i_0_24, negated_conjecture, (singleton(unordered_pair(singleton(esk10_0),unordered_pair(esk10_0,esk11_0)))!=cartesian_product2(singleton(esk10_0),singleton(esk11_0))), inference(start_rule)).
% 0.20/0.38 cnf(i_0_33, plain, (singleton(unordered_pair(singleton(esk10_0),unordered_pair(esk10_0,esk11_0)))!=cartesian_product2(singleton(esk10_0),singleton(esk11_0))), inference(extension_rule, [i_0_8])).
% 0.20/0.38 cnf(i_0_65, plain, (in(esk6_3(singleton(esk10_0),singleton(esk11_0),singleton(unordered_pair(singleton(esk10_0),unordered_pair(esk10_0,esk11_0)))),singleton(esk11_0))), inference(extension_rule, [i_0_1])).
% 0.20/0.38 cnf(i_0_66, plain, (in(esk4_3(singleton(esk10_0),singleton(esk11_0),singleton(unordered_pair(singleton(esk10_0),unordered_pair(esk10_0,esk11_0)))),singleton(unordered_pair(singleton(esk10_0),unordered_pair(esk10_0,esk11_0))))), inference(etableau_closure_rule, [i_0_66, ...])).
% 0.20/0.38 cnf(i_0_78, plain, (~in(singleton(esk11_0),esk6_3(singleton(esk10_0),singleton(esk11_0),singleton(unordered_pair(singleton(esk10_0),unordered_pair(esk10_0,esk11_0)))))), inference(etableau_closure_rule, [i_0_78, ...])).
% 0.20/0.38 # End printing tableau
% 0.20/0.38 # SZS output end
% 0.20/0.38 # Branches closed with saturation will be marked with an "s"
% 0.20/0.38 # Child (23579) has found a proof.
% 0.20/0.38
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------