%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG082+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 : n022.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:18 EDT 2022 % Result : Theorem 10.13s 1.70s % Output : CNFRefutation 10.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : RNG082+1 : TPTP v8.1.0. Released v4.0.0. % 0.11/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 : n022.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 : Mon May 30 05:19:37 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN % 0.12/0.36 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 19 Number of unprocessed: 19 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 19 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 4 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 15 extension rule candidate clauses % 0.12/0.36 # 4 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 47 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 47 tableaux to operate on % 10.13/1.70 # There were 2 total branch saturation attempts. % 10.13/1.70 # There were 0 of these attempts blocked. % 10.13/1.70 # There were 0 deferred branch saturation attempts. % 10.13/1.70 # There were 0 free duplicated saturations. % 10.13/1.70 # There were 2 total successful branch saturations. % 10.13/1.70 # There were 0 successful branch saturations in interreduction. % 10.13/1.70 # There were 0 successful branch saturations on the branch. % 10.13/1.70 # There were 2 successful branch saturations after the branch. % 10.13/1.70 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.13/1.70 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.13/1.70 # Begin clausification derivation % 10.13/1.70 % 10.13/1.70 # End clausification derivation % 10.13/1.70 # Begin listing active clauses obtained from FOF to CNF conversion % 10.13/1.70 cnf(i_0_3, plain, (aElement0(sz10))). % 10.13/1.70 cnf(i_0_19, hypothesis, (aElement0(xx))). % 10.13/1.70 cnf(i_0_2, plain, (aElement0(sz00))). % 10.13/1.70 cnf(i_0_20, negated_conjecture, (sdtasdt0(smndt0(sz10),xx)!=smndt0(xx))). % 10.13/1.70 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aElement0(X1))). % 10.13/1.70 cnf(i_0_4, plain, (aElement0(smndt0(X1))|~aElement0(X1))). % 10.13/1.70 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aElement0(X1))). % 10.13/1.70 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aElement0(X1))). % 10.13/1.70 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aElement0(X1))). % 10.13/1.70 cnf(i_0_5, plain, (aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1))). % 10.13/1.70 cnf(i_0_6, plain, (aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1))). % 10.13/1.70 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aElement0(X1))). % 10.13/1.70 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aElement0(X1))). % 10.13/1.70 cnf(i_0_13, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1))). % 10.13/1.70 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aElement0(X2)|~aElement0(X1))). % 10.13/1.70 cnf(i_0_14, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 10.13/1.70 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 10.13/1.70 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 10.13/1.70 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1))). % 10.13/1.70 cnf(i_0_64, plain, (X25=X25)). % 10.13/1.70 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 10.13/1.70 # Begin printing tableau % 10.13/1.70 # Found 7 steps % 10.13/1.70 cnf(i_0_3, plain, (aElement0(sz10)), inference(start_rule)). % 10.13/1.70 cnf(i_0_72, plain, (aElement0(sz10)), inference(extension_rule, [i_0_8])). % 10.13/1.70 cnf(i_0_150, plain, (~aElement0(sz10)), inference(closure_rule, [i_0_3])). % 10.13/1.70 cnf(i_0_151, plain, (~aElement0(sz10)), inference(closure_rule, [i_0_3])). % 10.13/1.70 cnf(i_0_149, plain, (sdtpldt0(sdtpldt0(sz10,sz10),sz10)=sdtpldt0(sz10,sdtpldt0(sz10,sz10))), inference(extension_rule, [i_0_68])). % 10.13/1.70 cnf(i_0_436, plain, (aElement0(sdtpldt0(sz10,sdtpldt0(sz10,sz10)))), inference(etableau_closure_rule, [i_0_436, ...])). % 10.13/1.70 cnf(i_0_438, plain, (~aElement0(sdtpldt0(sdtpldt0(sz10,sz10),sz10))), inference(etableau_closure_rule, [i_0_438, ...])). % 10.13/1.70 # End printing tableau % 10.13/1.70 # SZS output end % 10.13/1.70 # Branches closed with saturation will be marked with an "s" % 10.13/1.71 # Child (1554) has found a proof. % 10.13/1.71 % 10.13/1.71 # Proof search is over... % 10.13/1.71 # Freeing feature tree %------------------------------------------------------------------------------