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