TSTP Solution File: SEU131+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU131+1 : TPTP v8.1.0. Released v3.3.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 : n004.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 09:24:01 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 : SEU131+1 : TPTP v8.1.0. Released v3.3.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.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 07:05:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 23 Number of unprocessed: 23
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 23 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 2 conjectures.
% 0.20/0.37 # There are 2 start rule candidates:
% 0.20/0.37 # Found 6 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 2 start rule tableaux created.
% 0.20/0.37 # 17 extension rule candidate clauses
% 0.20/0.37 # 6 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 0.20/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 8 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 # There were 3 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 3 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 3 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox2/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_13, plain, (empty(empty_set))).
% 0.20/0.38 cnf(i_0_22, plain, (set_difference(empty_set,X1)=empty_set)).
% 0.20/0.38 cnf(i_0_16, plain, (empty(esk5_0))).
% 0.20/0.38 cnf(i_0_21, plain, (set_difference(X1,empty_set)=X1)).
% 0.20/0.38 cnf(i_0_18, plain, (subset(X1,X1))).
% 0.20/0.38 cnf(i_0_17, plain, (~empty(esk6_0))).
% 0.20/0.38 cnf(i_0_15, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0))).
% 0.20/0.38 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,esk4_0)=empty_set|subset(esk3_0,esk4_0))).
% 0.20/0.38 cnf(i_0_24, plain, (~empty(X1)|~in(X2,X1))).
% 0.20/0.38 cnf(i_0_23, plain, (X1=empty_set|~empty(X1))).
% 0.20/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.20/0.38 cnf(i_0_25, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.20/0.38 cnf(i_0_2, plain, (subset(X1,X2)|~in(esk1_2(X1,X2),X2))).
% 0.20/0.38 cnf(i_0_9, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))).
% 0.20/0.38 cnf(i_0_3, plain, (subset(X1,X2)|in(esk1_2(X1,X2),X1))).
% 0.20/0.38 cnf(i_0_4, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 0.20/0.38 cnf(i_0_10, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))).
% 0.20/0.38 cnf(i_0_20, plain, (X1=X2|~in(esk7_2(X1,X2),X2)|~in(esk7_2(X1,X2),X1))).
% 0.20/0.38 cnf(i_0_8, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))).
% 0.20/0.38 cnf(i_0_19, plain, (X1=X2|in(esk7_2(X1,X2),X1)|in(esk7_2(X1,X2),X2))).
% 0.20/0.38 cnf(i_0_5, plain, (X1=set_difference(X2,X3)|in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3))).
% 0.20/0.38 cnf(i_0_6, plain, (X1=set_difference(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))).
% 0.20/0.38 cnf(i_0_7, plain, (X1=set_difference(X2,X3)|in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,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 10 steps
% 0.20/0.38 cnf(i_0_15, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0)), inference(start_rule)).
% 0.20/0.38 cnf(i_0_31, plain, (set_difference(esk3_0,esk4_0)!=empty_set), inference(extension_rule, [i_0_5])).
% 0.20/0.38 cnf(i_0_149, plain, (in(esk2_3(esk3_0,esk4_0,empty_set),empty_set)), inference(extension_rule, [i_0_24])).
% 0.20/0.38 cnf(i_0_162, plain, (~empty(empty_set)), inference(closure_rule, [i_0_13])).
% 0.20/0.38 cnf(i_0_150, plain, (~in(esk2_3(esk3_0,esk4_0,empty_set),esk4_0)), inference(extension_rule, [i_0_4])).
% 0.20/0.38 cnf(i_0_32, plain, (~subset(esk3_0,esk4_0)), inference(etableau_closure_rule, [i_0_32, ...])).
% 0.20/0.38 cnf(i_0_179, plain, (~in(esk2_3(esk3_0,esk4_0,empty_set),esk3_0)), inference(extension_rule, [i_0_10])).
% 0.20/0.38 cnf(i_0_178, plain, (~subset(esk3_0,esk4_0)), inference(extension_rule, [i_0_14])).
% 0.20/0.38 cnf(i_0_423, plain, (set_difference(esk3_0,esk4_0)=empty_set), inference(closure_rule, [i_0_31])).
% 0.20/0.38 cnf(i_0_374, plain, (~in(esk2_3(esk3_0,esk4_0,empty_set),set_difference(esk3_0,X7))), inference(etableau_closure_rule, [i_0_374, ...])).
% 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 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox2/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_13, plain, (empty(empty_set))).
% 0.20/0.38 cnf(i_0_22, plain, (set_difference(empty_set,X1)=empty_set)).
% 0.20/0.38 cnf(i_0_16, plain, (empty(esk5_0))).
% 0.20/0.38 cnf(i_0_21, plain, (set_difference(X1,empty_set)=X1)).
% 0.20/0.38 cnf(i_0_18, plain, (subset(X1,X1))).
% 0.20/0.38 cnf(i_0_17, plain, (~empty(esk6_0))).
% 0.20/0.38 cnf(i_0_15, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0))).
% 0.20/0.38 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,esk4_0)=empty_set|subset(esk3_0,esk4_0))).
% 0.20/0.38 cnf(i_0_24, plain, (~empty(X1)|~in(X2,X1))).
% 0.20/0.38 cnf(i_0_23, plain, (X1=empty_set|~empty(X1))).
% 0.20/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.20/0.38 cnf(i_0_25, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.20/0.38 cnf(i_0_2, plain, (subset(X1,X2)|~in(esk1_2(X1,X2),X2))).
% 0.20/0.38 cnf(i_0_9, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))).
% 0.20/0.38 cnf(i_0_3, plain, (subset(X1,X2)|in(esk1_2(X1,X2),X1))).
% 0.20/0.38 cnf(i_0_4, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))).
% 0.20/0.38 cnf(i_0_10, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))).
% 0.20/0.38 cnf(i_0_20, plain, (X1=X2|~in(esk7_2(X1,X2),X2)|~in(esk7_2(X1,X2),X1))).
% 0.20/0.38 cnf(i_0_8, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))).
% 0.20/0.38 cnf(i_0_19, plain, (X1=X2|in(esk7_2(X1,X2),X1)|in(esk7_2(X1,X2),X2))).
% 0.20/0.38 cnf(i_0_5, plain, (X1=set_difference(X2,X3)|in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3))).
% 0.20/0.38 cnf(i_0_6, plain, (X1=set_difference(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X1))).
% 0.20/0.38 cnf(i_0_7, plain, (X1=set_difference(X2,X3)|in(esk2_3(X2,X3,X1),X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,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 6 steps
% 0.20/0.38 cnf(i_0_15, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0)), inference(start_rule)).
% 0.20/0.38 cnf(i_0_31, plain, (set_difference(esk3_0,esk4_0)!=empty_set), inference(extension_rule, [i_0_19])).
% 0.20/0.38 cnf(i_0_146, plain, (in(esk7_2(set_difference(esk3_0,esk4_0),empty_set),set_difference(esk3_0,esk4_0))), inference(extension_rule, [i_0_24])).
% 0.20/0.38 cnf(i_0_32, plain, (~subset(esk3_0,esk4_0)), inference(etableau_closure_rule, [i_0_32, ...])).
% 0.20/0.38 cnf(i_0_147, plain, (in(esk7_2(set_difference(esk3_0,esk4_0),empty_set),empty_set)), inference(etableau_closure_rule, [i_0_147, ...])).
% 0.20/0.38 cnf(i_0_162, plain, (~empty(set_difference(esk3_0,esk4_0))), inference(etableau_closure_rule, [i_0_162, ...])).
% 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.39 # Child (30470) has found a proof.
% 0.20/0.39
% 0.20/0.39 # Proof search is over...
% 0.20/0.39 # Freeing feature tree
%------------------------------------------------------------------------------