TSTP Solution File: NUM533+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM533+2 : TPTP v8.1.0. Released 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 : n020.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 : Mon Jul 18 09:42:03 EDT 2022
% Result : Theorem 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM533+2 : TPTP v8.1.0. Released 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.12/0.33 % Computer : n020.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 : Wed Jul 6 03:24:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 24 Number of unprocessed: 24
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 24 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 7 conjectures.
% 0.19/0.36 # There are 7 start rule candidates:
% 0.19/0.36 # Found 12 unit axioms.
% 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.36 # 7 start rule tableaux created.
% 0.19/0.36 # 12 extension rule candidate clauses
% 0.19/0.36 # 12 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 7
% 0.19/0.36 # Closed tableau found in foldup close cycle with 0 folds and 3 closures done.
% 0.19/0.36 # There were 0 total branch saturation attempts.
% 0.19/0.36 # There were 0 of these attempts blocked.
% 0.19/0.36 # There were 0 deferred branch saturation attempts.
% 0.19/0.36 # There were 0 free duplicated saturations.
% 0.19/0.36 # There were 0 total successful branch saturations.
% 0.19/0.36 # There were 0 successful branch saturations in interreduction.
% 0.19/0.36 # There were 0 successful branch saturations on the branch.
% 0.19/0.36 # There were 0 successful branch saturations after the branch.
% 0.19/0.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # Begin clausification derivation
% 0.19/0.36
% 0.19/0.36 # End clausification derivation
% 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36 cnf(i_0_21, hypothesis, (aSet0(xA))).
% 0.19/0.36 cnf(i_0_24, negated_conjecture, (aElementOf0(esk3_0,xA))).
% 0.19/0.36 cnf(i_0_27, negated_conjecture, (aSubsetOf0(xA,xB))).
% 0.19/0.36 cnf(i_0_20, hypothesis, (aSet0(xB))).
% 0.19/0.36 cnf(i_0_19, hypothesis, (aSet0(xC))).
% 0.19/0.36 cnf(i_0_8, plain, (isFinite0(slcrc0))).
% 0.19/0.36 cnf(i_0_25, negated_conjecture, (aSubsetOf0(xB,xC))).
% 0.19/0.36 cnf(i_0_7, plain, (aSet0(slcrc0))).
% 0.19/0.36 cnf(i_0_23, negated_conjecture, (~aElementOf0(esk3_0,xC))).
% 0.19/0.36 cnf(i_0_22, negated_conjecture, (~aSubsetOf0(xA,xC))).
% 0.19/0.36 cnf(i_0_6, plain, (~aElementOf0(X1,slcrc0))).
% 0.19/0.36 cnf(i_0_11, plain, (~isCountable0(slcrc0))).
% 0.19/0.36 cnf(i_0_10, plain, (~isCountable0(X1)|~isFinite0(X1)|~aSet0(X1))).
% 0.19/0.36 cnf(i_0_28, negated_conjecture, (aElementOf0(X1,xB)|~aElementOf0(X1,xA))).
% 0.19/0.36 cnf(i_0_26, negated_conjecture, (aElementOf0(X1,xC)|~aElementOf0(X1,xB))).
% 0.19/0.36 cnf(i_0_17, plain, (aSubsetOf0(X1,X1)|~aSet0(X1))).
% 0.19/0.36 cnf(i_0_15, plain, (aSet0(X1)|~aSubsetOf0(X1,X2)|~aSet0(X2))).
% 0.19/0.36 cnf(i_0_3, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))).
% 0.19/0.36 cnf(i_0_16, plain, (isFinite0(X1)|~aSubsetOf0(X1,X2)|~isFinite0(X2)|~aSet0(X2))).
% 0.19/0.36 cnf(i_0_5, plain, (X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1))).
% 0.19/0.36 cnf(i_0_14, plain, (aElementOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aElementOf0(X1,X3)|~aSet0(X2))).
% 0.19/0.36 cnf(i_0_18, plain, (X1=X2|~aSubsetOf0(X2,X1)|~aSubsetOf0(X1,X2)|~aSet0(X2))).
% 0.19/0.36 cnf(i_0_12, plain, (aSubsetOf0(X1,X2)|~aElementOf0(esk2_2(X2,X1),X2)|~aSet0(X1)|~aSet0(X2))).
% 0.19/0.36 cnf(i_0_13, plain, (aSubsetOf0(X1,X2)|aElementOf0(esk2_2(X2,X1),X1)|~aSet0(X1)|~aSet0(X2))).
% 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.36 # Begin printing tableau
% 0.19/0.36 # Found 6 steps
% 0.19/0.36 cnf(i_0_26, negated_conjecture, (aElementOf0(esk3_0,xC)|~aElementOf0(esk3_0,xB)), inference(start_rule)).
% 0.19/0.36 cnf(i_0_32, plain, (aElementOf0(esk3_0,xC)), inference(closure_rule, [i_0_23])).
% 0.19/0.36 cnf(i_0_33, plain, (~aElementOf0(esk3_0,xB)), inference(extension_rule, [i_0_14])).
% 0.19/0.36 cnf(i_0_60, plain, (~aSubsetOf0(xA,xB)), inference(closure_rule, [i_0_27])).
% 0.19/0.36 cnf(i_0_61, plain, (~aElementOf0(esk3_0,xA)), inference(closure_rule, [i_0_24])).
% 0.19/0.36 cnf(i_0_62, plain, (~aSet0(xB)), inference(closure_rule, [i_0_20])).
% 0.19/0.36 # End printing tableau
% 0.19/0.36 # SZS output end
% 0.19/0.36 # Branches closed with saturation will be marked with an "s"
% 0.19/0.36 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36 # We now have 7 tableaux to operate on
% 0.19/0.36 # Found closed tableau during pool population.
% 0.19/0.36 # Proof search is over...
% 0.19/0.36 # Freeing feature tree
%------------------------------------------------------------------------------