TSTP Solution File: RNG093+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : RNG093+1 : 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 : n027.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 20:27:20 EDT 2022
% Result : Theorem 1.24s 1.42s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : RNG093+1 : TPTP v8.1.0. Released v4.0.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 : n027.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 : Mon May 30 19:15:16 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 56 Number of unprocessed: 56
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 1.08/1.27 # The folding up rule is enabled...
% 1.08/1.27 # Local unification is enabled...
% 1.08/1.27 # Any saturation attempts will use folding labels...
% 1.08/1.27 # 56 beginning clauses after preprocessing and clausification
% 1.08/1.27 # Creating start rules for all 1 conjectures.
% 1.08/1.27 # There are 1 start rule candidates:
% 1.08/1.27 # Found 6 unit axioms.
% 1.08/1.27 # 1 start rule tableaux created.
% 1.08/1.27 # 50 extension rule candidate clauses
% 1.08/1.27 # 6 unit axiom clauses
% 1.08/1.27
% 1.08/1.27 # Requested 8, 32 cores available to the main process.
% 1.08/1.27 # There are not enough tableaux to fork, creating more from the initial 1
% 1.24/1.42 # There were 6 total branch saturation attempts.
% 1.24/1.42 # There were 0 of these attempts blocked.
% 1.24/1.42 # There were 0 deferred branch saturation attempts.
% 1.24/1.42 # There were 0 free duplicated saturations.
% 1.24/1.42 # There were 6 total successful branch saturations.
% 1.24/1.42 # There were 0 successful branch saturations in interreduction.
% 1.24/1.42 # There were 0 successful branch saturations on the branch.
% 1.24/1.42 # There were 6 successful branch saturations after the branch.
% 1.24/1.42 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.24/1.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.24/1.42 # Begin clausification derivation
% 1.24/1.42
% 1.24/1.42 # End clausification derivation
% 1.24/1.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.24/1.42 cnf(i_0_57, hypothesis, (aIdeal0(xI))).
% 1.24/1.42 cnf(i_0_56, hypothesis, (aIdeal0(xJ))).
% 1.24/1.42 cnf(i_0_2, plain, (aElement0(sz00))).
% 1.24/1.42 cnf(i_0_3, plain, (aElement0(sz10))).
% 1.24/1.42 cnf(i_0_58, negated_conjecture, (~aIdeal0(sdtasasdt0(xI,xJ)))).
% 1.24/1.42 cnf(i_0_24, plain, (sz10!=sz00)).
% 1.24/1.42 cnf(i_0_54, plain, (aSet0(X1)|~aIdeal0(X1))).
% 1.24/1.42 cnf(i_0_4, plain, (aElement0(smndt0(X1))|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_26, plain, (aElement0(X1)|~aElementOf0(X1,X2)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_21, plain, (sdtasdt0(sz00,X1)=sz00|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_55, plain, (aIdeal0(sdtpldt1(X1,X2))|~aIdeal0(X2)|~aIdeal0(X1))).
% 1.24/1.42 cnf(i_0_22, plain, (sdtasdt0(X1,sz00)=sz00|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_5, plain, (aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_6, plain, (aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_39, plain, (aSet0(sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_51, plain, (aIdeal0(X1)|aElementOf0(esk9_1(X1),X1)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_46, plain, (aSet0(sdtasasdt0(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_19, plain, (smndt0(X1)=sdtasdt0(X1,smndt0(sz10))|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_20, plain, (sdtasdt0(smndt0(sz10),X1)=smndt0(X1)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_23, plain, (X1=sz00|X2=sz00|sdtasdt0(X1,X2)!=sz00|~aElement0(X2)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aElement0(X2)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_27, plain, (X1=X2|~aElementOf0(esk1_2(X1,X2),X2)|~aElementOf0(esk2_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_52, plain, (aElementOf0(sdtasdt0(X1,X2),X3)|~aIdeal0(X3)|~aElementOf0(X2,X3)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_13, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_50, plain, (aIdeal0(X1)|aElementOf0(esk10_1(X1),X1)|aElement0(esk11_1(X1))|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_44, plain, (aElementOf0(X1,X2)|~aElementOf0(X1,sdtasasdt0(X3,X2))|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_48, plain, (aIdeal0(X1)|aElement0(esk11_1(X1))|~aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_53, plain, (aElementOf0(sdtpldt0(X1,X2),X3)|~aIdeal0(X3)|~aElementOf0(X1,X3)|~aElementOf0(X2,X3))).
% 1.24/1.42 cnf(i_0_49, plain, (aIdeal0(X1)|aElementOf0(esk10_1(X1),X1)|~aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_45, plain, (aElementOf0(X1,X2)|~aElementOf0(X1,sdtasasdt0(X2,X3))|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_47, plain, (aIdeal0(X1)|~aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1)|~aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_29, plain, (X1=X2|aElementOf0(esk1_2(X1,X2),X1)|~aElementOf0(esk2_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_43, plain, (aElementOf0(X1,sdtasasdt0(X2,X3))|~aElementOf0(X1,X3)|~aElementOf0(X1,X2)|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_28, plain, (X1=X2|aElementOf0(esk2_2(X1,X2),X2)|~aElementOf0(esk1_2(X1,X2),X2)|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_14, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_30, plain, (X1=X2|aElementOf0(esk2_2(X1,X2),X2)|aElementOf0(esk1_2(X1,X2),X1)|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_38, plain, (aElementOf0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),X1)|~aElementOf0(X3,sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_35, plain, (aElementOf0(sdtpldt0(X1,X2),sdtpldt1(X3,X4))|~aElementOf0(X2,X4)|~aElementOf0(X1,X3)|~aSet0(X4)|~aSet0(X3))).
% 1.24/1.42 cnf(i_0_37, plain, (aElementOf0(esk4_4(X1,X2,sdtpldt1(X1,X2),X3),X2)|~aElementOf0(X3,sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1))).
% 1.24/1.42 cnf(i_0_33, plain, (X1=sdtpldt1(X2,X3)|aElementOf0(esk6_3(X2,X3,X1),X2)|aElementOf0(esk5_3(X2,X3,X1),X1)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_32, plain, (X1=sdtpldt1(X2,X3)|aElementOf0(esk7_3(X2,X3,X1),X3)|aElementOf0(esk5_3(X2,X3,X1),X1)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_40, plain, (X1=sdtasasdt0(X2,X3)|aElementOf0(esk8_3(X2,X3,X1),X3)|aElementOf0(esk8_3(X2,X3,X1),X1)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_36, plain, (sdtpldt0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),esk4_4(X1,X2,sdtpldt1(X1,X2),X3))=X3|~aElementOf0(X3,sdtpldt1(X1,X2))|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 cnf(i_0_41, plain, (X1=sdtasasdt0(X2,X3)|aElementOf0(esk8_3(X2,X3,X1),X2)|aElementOf0(esk8_3(X2,X3,X1),X1)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_42, plain, (X1=sdtasasdt0(X2,X3)|~aElementOf0(esk8_3(X2,X3,X1),X1)|~aElementOf0(esk8_3(X2,X3,X1),X3)|~aElementOf0(esk8_3(X2,X3,X1),X2)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_34, plain, (X1=sdtpldt1(X2,X3)|sdtpldt0(X4,X5)!=esk5_3(X2,X3,X1)|~aElementOf0(esk5_3(X2,X3,X1),X1)|~aElementOf0(X5,X3)|~aElementOf0(X4,X2)|~aSet0(X1)|~aSet0(X3)|~aSet0(X2))).
% 1.24/1.42 cnf(i_0_31, plain, (sdtpldt0(esk6_3(X1,X2,X3),esk7_3(X1,X2,X3))=esk5_3(X1,X2,X3)|X3=sdtpldt1(X1,X2)|aElementOf0(esk5_3(X1,X2,X3),X3)|~aSet0(X3)|~aSet0(X2)|~aSet0(X1))).
% 1.24/1.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.24/1.42 # Begin printing tableau
% 1.24/1.42 # Found 9 steps
% 1.24/1.42 cnf(i_0_58, negated_conjecture, (~aIdeal0(sdtasasdt0(xI,xJ))), inference(start_rule)).
% 1.24/1.42 cnf(i_0_69, plain, (~aIdeal0(sdtasasdt0(xI,xJ))), inference(extension_rule, [i_0_47])).
% 1.24/1.42 cnf(i_0_160, plain, (~aElementOf0(sdtpldt0(esk9_1(sdtasasdt0(xI,xJ)),esk10_1(sdtasasdt0(xI,xJ))),sdtasasdt0(xI,xJ))), inference(extension_rule, [i_0_43])).
% 1.24/1.42 cnf(i_0_161, plain, (~aElementOf0(sdtasdt0(esk11_1(sdtasasdt0(xI,xJ)),esk9_1(sdtasasdt0(xI,xJ))),sdtasasdt0(xI,xJ))), inference(etableau_closure_rule, [i_0_161, ...])).
% 1.24/1.42 cnf(i_0_162, plain, (~aSet0(sdtasasdt0(xI,xJ))), inference(etableau_closure_rule, [i_0_162, ...])).
% 1.24/1.42 cnf(i_0_360, plain, (~aElementOf0(sdtpldt0(esk9_1(sdtasasdt0(xI,xJ)),esk10_1(sdtasasdt0(xI,xJ))),xJ)), inference(etableau_closure_rule, [i_0_360, ...])).
% 1.24/1.42 cnf(i_0_361, plain, (~aElementOf0(sdtpldt0(esk9_1(sdtasasdt0(xI,xJ)),esk10_1(sdtasasdt0(xI,xJ))),xI)), inference(etableau_closure_rule, [i_0_361, ...])).
% 1.24/1.42 cnf(i_0_362, plain, (~aSet0(xJ)), inference(etableau_closure_rule, [i_0_362, ...])).
% 1.24/1.42 cnf(i_0_363, plain, (~aSet0(xI)), inference(etableau_closure_rule, [i_0_363, ...])).
% 1.24/1.42 # End printing tableau
% 1.24/1.42 # SZS output end
% 1.24/1.42 # Branches closed with saturation will be marked with an "s"
% 1.24/1.42 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 1.24/1.42 # We now have 5 tableaux to operate on
% 1.24/1.42 # Found closed tableau during pool population.
% 1.24/1.42 # Proof search is over...
% 1.24/1.42 # Freeing feature tree
%------------------------------------------------------------------------------